Skip to search formSkip to main contentSkip to account menu

Dulmage–Mendelsohn decomposition

Known as: Dulmage-Mendelsohn decomposition 
In graph theory, the Dulmage–Mendelsohn decomposition is a partition of the vertices of a bipartite graph into subsets, with the property that two… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory applicable for bipartite graphs… 
2016
2016
We establish the theory of the Dulmage-Mendelsohn decomposition for $b$-matchings. The original Dulmage-Mendelsohn decomposition… 
2013
2013
The Okavango Basin is situated in southern Africa within the three countries Angola, Namibia and Botswana. It can be subdivided… 
2011
2011
Shibata S, Kagaya H, Inamoto Y, Saitoh E, Okada S, Ota K, Kanamori D. Swallowing maneuver analysis using 320-row area detector… 
Highly Cited
2007
Highly Cited
2005
Highly Cited
2005
We describe a reordering particularly suited to the PageRank problem, which reduces the computation of the PageRank vector to… 
1998
1998
In this paper, we consider the use of the Dulmage--Mendelsohn decomposition and network flow on bipartite graphs to improve a…