collaborators

1 paper

cs.DM2016

Making Bipartite Graphs DM-irreducible

Kristóf Bérczi, Satoru Iwata, Jun Kato +1

The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matching…