Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Dulmage–Mendelsohn_decomposition> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples 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 wikiPageExternalLink MSc_JJ_Koelewijn.PDF.
- Dulmage–Mendelsohn_decomposition wikiPageExternalLink p21_Bunus.pdf.
- Dulmage–Mendelsohn_decomposition wikiPageExternalLink spooles.2.2.html.
- Dulmage–Mendelsohn_decomposition wikiPageID "2669524".
- Dulmage–Mendelsohn_decomposition wikiPageLength "3799".
- Dulmage–Mendelsohn_decomposition wikiPageOutDegree "14".
- Dulmage–Mendelsohn_decomposition wikiPageRevisionID "606319735".
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Bipartite_graph.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Category:Graph_algorithms.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Category:Matching.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Cycle_(graph_theory).
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Directed_graph.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Finite_element_analysis.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Finite_element_method.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Graph_theory.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Independent_set_(graph_theory).
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Matching_(graph_theory).
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Matching_preclusion.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Maximum_matching.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Nathan_Mendelsohn.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Perfect_matching.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Simple_cycle.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLink Strongly_connected_component.
- Dulmage–Mendelsohn_decomposition wikiPageWikiLinkText "Dulmage–Mendelsohn decomposition".
- Dulmage–Mendelsohn_decomposition hasPhotoCollection Dulmage–Mendelsohn_decomposition.
- Dulmage–Mendelsohn_decomposition wikiPageUsesTemplate Template:Cite_journal.
- 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 m.07wr7b.
- Dulmage–Mendelsohn_decomposition sameAs Dulmage–Mendelsohn_dekompozicija.
- Dulmage–Mendelsohn_decomposition sameAs Q5313464.
- Dulmage–Mendelsohn_decomposition sameAs Q5313464.
- Dulmage–Mendelsohn_decomposition wasDerivedFrom Dulmage–Mendelsohn_decomposition?oldid=606319735.
- Dulmage–Mendelsohn_decomposition isPrimaryTopicOf Dulmage–Mendelsohn_decomposition.