✦ LIBER ✦

Finding all the perfect matchings in bipartite graphs

✍ Scribed by K. Fukuda; T. Matsui

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 283 KB
Volume: 7
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(94)90045-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding all minimum-cost perfect matchin

Finding all minimum-cost perfect matchings in Bipartite graphs

✍ Komei Fukuda; Tomomi Matsui 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

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

Induced matchings in bipartite graphs

✍ R.J. Faudree; A. Gyárfas; R.H. Schelp; Zs. Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Finding maximum matching for bipartite g

Finding maximum matching for bipartite graphs in parallel

✍ Pranay Chaudhuri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 148 KB

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

The rainbow number of matchings in regul

The rainbow number of matchings in regular bipartite graphs

✍ Xueliang Li; Zhixia Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular