About: Dulmage–Mendelsohn decomposition

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Dulmage–Mendelsohn decomposition Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:AnatomicalStructure, within Data Space : el.dbpedia.org associated with source document(s)

In graph theory, the Dulmage–Mendelsohn decomposition is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. It is named after A. L. Dulmage and Nathan Mendelsohn, who published it in 1958. A generalization to any graph is the Edmonds–Gallai decomposition, using the Blossom algorithm.

Attributes	Values
rdf:type	anatomical structure
rdfs:label	Dulmage–Mendelsohn decomposition (en)
rdfs:comment	In graph theory, the Dulmage–Mendelsohn decomposition is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. It is named after A. L. Dulmage and Nathan Mendelsohn, who published it in 1958. A generalization to any graph is the Edmonds–Gallai decomposition, using the Blossom algorithm. (en)
sameAs	Dulmage–Mendelsohn decomposition
dbp:wikiPageUsesTemplate	dbt:Cite_journal dbt:Reflist dbt:Short_description
Subject	Graph algorithms Matching (graph theory)
thumbnail	wiki-commons:Special:FilePath/Even-odd-decomposition.svg?width=300
foaf:depiction
gold:hypernym	Partition
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Dulmage–Mendelsohn_decomposition?oldid=1070336393&ns=0
Wikipage page ID	2669524 (xsd:integer)
page length (characters) of wiki page	7207 (xsd:nonNegativeInteger)
Wikipage revision ID	1070336393 (xsd:integer)
Link from a Wikipage to another Wikipage	Bipartite graph Graph algorithms Matching (graph theory) Directed graph Cycle (graph theory) Degeneracy (graph theory) Core (graph theory) Nathan Mendelsohn Blossom algorithm Finite element method Gallai–Edmonds decomposition Graph theory Independent set (graph theory) Perfect matching Strongly connected component Matching preclusion Maximum cardinality matching
has abstract	In graph theory, the Dulmage–Mendelsohn decomposition is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. It is named after A. L. Dulmage and Nathan Mendelsohn, who published it in 1958. A generalization to any graph is the Edmonds–Gallai decomposition, using the Blossom algorithm. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Dulmage–Mendelsohn_decomposition
is Wikipage redirect of	Dulmage-Mendelsohn Decomposition Dulmage-Mendelsohn decomposition
is Link from a Wikipage to another Wikipage of	Algebraic graph theory Bipartite graph Glossary of graph theory Dulmage-Mendelsohn Decomposition Dulmage-Mendelsohn decomposition Nathan Mendelsohn Gallai–Edmonds decomposition Matching (graph theory)
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Dulmage–Mendelsohn_decomposition

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software