Dulmage–Mendelsohn decomposition (source code)

= Dulmage–Mendelsohn decomposition
{wiki=Dulmage–Mendelsohn_decomposition}

The Dulmage–Mendelsohn decomposition is a concept in graph theory that pertains to bipartite graphs, particularly in the context of matching theory. This decomposition helps in understanding the structure of bipartite graphs and their matchings.