Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Abstract Optimism and hope are individual difference factors that protect against the development of psychological disorders… Expand
Is this relevant?
2018
2018
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory applicable for bipartite graphs… Expand
Is this relevant?
2016
2016
We establish the theory of the Dulmage-Mendelsohn decomposition for $b$-matchings. The original Dulmage-Mendelsohn decomposition… Expand
Is this relevant?
2013
2013
The Okavango Basin is situated in southern Africa within the three countries Angola, Namibia and Botswana. It can be subdivided… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this paper we present an efficient algorithm for computing a sparse null space basis for a full row rank matrix. We first… Expand
Is this relevant?
2012
2012
We introduce a new generic propagation mechanism for constraint programming. A first advantage of our pruning technique stems… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Shibata S, Kagaya H, Inamoto Y, Saitoh E, Okada S, Ota K, Kanamori D. Swallowing maneuver analysis using 320-row area detector… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
This work is devoted to find an optimal set of sensors for model-based FDI. The novelty is that binary integer linear programming… Expand
  • figure 1
  • table 1
  • table 2
  • table 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We describe a reordering particularly suited to the PageRank problem, which reduces the computation of the PageRank vector to… Expand
  • figure 1
  • table 1
Is this relevant?
2006
2006
Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn… Expand
Is this relevant?