𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A perfect matching algorithm for sparse bipartite graphs

✍ Scribed by Eugeniusz Toczyłowski

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
366 KB
Volume
9
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple matching algorithm for regular
A simple matching algorithm for regular bipartite graphs
✍ Kazuhisa Makino; Takashi Takabatake; Satoru Fujishige 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

We consider the perfect matching problem for a ∆-regular bipartite graph with n vertices and m edges, i.e., 1 2 n∆ = m, and present a new O(m + n log n log ∆) algorithm. Cole and Rizzi, respectively, gave algorithms of the same complexity as ours, Schrijver also devised an O(m∆) algorithm, and the b

Transversal hypergraphs to perfect match
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

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 an explicit characterization of the minimal blockers of a bipartite graph G. This result allows us to obtain a polynomial delay algorithm for finding all minimal blockers

Special parity of perfect matchings in b
Special parity of perfect matchings in bipartite graphs
✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n

Perfect matchings and ears in elementary
Perfect matchings and ears in elementary bipartite graphs
✍ Pierre Hansen; Fuji Zhang; Maolin Zheng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 386 KB

We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, a method to construct all minimal elementary bipartite graphs is described.