Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,286,858 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algebraic graph theory
Directed graph
Graph theory
Independent set (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Optimism, hope, and attention for emotional stimuli
L. J. Kelberer
,
Morganne A Kraines
,
T. Wells
2018
Corpus ID: 54064824
2017
2017
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality
Nanao Kita
International Computing and Combinatorics…
2017
Corpus ID: 49621440
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory applicable for bipartite graphs…
Expand
2016
2016
The Dulmage-Mendelsohn Decomposition for $b$-Matchings
Nanao Kita
2016
Corpus ID: 119710287
We establish the theory of the Dulmage-Mendelsohn decomposition for $b$-matchings. The original Dulmage-Mendelsohn decomposition…
Expand
2015
2015
Decomposition theorems for square-free 2-matchings in bipartite graphs
Kenjiro Takazawa
Discrete Applied Mathematics
2015
Corpus ID: 14625028
2013
2013
Okavango Basin - Physicogeographical setting
J. Wehberg
2013
Corpus ID: 55689589
The Okavango Basin is situated in southern Africa within the three countries Angola, Namibia and Botswana. It can be subdivided…
Expand
2011
2011
Swallowing maneuver analysis using 320-row area detector computed tomography (320-ADCT)
S. Shibata
,
H. Kagaya
,
+4 authors
D. Kanamori
Japanese Journal of Comprehensive Rehabilitation…
2011
Corpus ID: 54986706
Shibata S, Kagaya H, Inamoto Y, Saitoh E, Okada S, Ota K, Kanamori D. Swallowing maneuver analysis using 320-row area detector…
Expand
Highly Cited
2007
Highly Cited
2007
Bilateral bargaining in networks
A. Polanski
Journal of Economics Theory
2007
Corpus ID: 29644894
Highly Cited
2005
Highly Cited
2005
A Reordering for the PageRank Problem
A. Langville
,
C. D. Meyer
SIAM Journal on Scientific Computing
2005
Corpus ID: 10323158
We describe a reordering particularly suited to the PageRank problem, which reduces the computation of the PageRank vector to…
Expand
1998
1998
Applications of the Dulmage-Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
C. Ashcraft
,
Joseph W. H. Liu
SIAM Journal on Matrix Analysis and Applications
1998
Corpus ID: 15632251
In this paper, we consider the use of the Dulmage--Mendelsohn decomposition and network flow on bipartite graphs to improve a…
Expand
Highly Cited
1973
Highly Cited
1973
Hemispheric specialization for pitch and "tone": Evidence from Thai.
D. V. Lancker
,
V. Fromkin
1973
Corpus ID: 12729014
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE