Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dulmage–Mendelsohn_decomposition> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Dulmage–Mendelsohn_decomposition 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.".
- Dulmage–Mendelsohn_decomposition wikiPageID "2669524".
- Dulmage–Mendelsohn_decomposition wikiPageRevisionID "606319735".
- Dulmage–Mendelsohn_decomposition subject Category:Graph_algorithms.
- Dulmage–Mendelsohn_decomposition subject Category:Matching.
- Dulmage–Mendelsohn_decomposition 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.".
- Dulmage–Mendelsohn_decomposition label "Dulmage–Mendelsohn decomposition".
- Dulmage–Mendelsohn_decomposition sameAs Dulmage%E2%80%93Mendelsohn_decomposition.
- Dulmage–Mendelsohn_decomposition sameAs Q5313464.
- Dulmage–Mendelsohn_decomposition sameAs Q5313464.
- Dulmage–Mendelsohn_decomposition wasDerivedFrom Dulmage–Mendelsohn_decomposition?oldid=606319735.