A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give a polynomial delay algorithm for finding all minimal blockers of a given bipartite graph. Equivalently, this gives a polynomial delay algorithm for listing the anti-vertices of the perfect matching polytope P(G) = {x ℝE | Hx=e, x ≥ 0}, where H is the incidence matrix of G. We also give similar generation algorithms for other related problems, including d-factors in bipartite graphs, and perfect 2-matchings in general graphs. © Springer-Verlag 2004.
CITATION STYLE
Boros, E., Elbassioni, K., & Gurvich, V. (2004). Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3221, 122–133. https://doi.org/10.1007/978-3-540-30140-0_13
Mendeley helps you to discover research relevant for your work.