✦ LIBER ✦

Maximum matching in a convex bipartite graph

✍ Scribed by Fred Glover

Publisher: John Wiley and Sons
Year: 1967
Tongue: English
Weight: 197 KB
Volume: 14
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800140304

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Computing a maximum cardinality matching

Computing a maximum cardinality matching in a bipartite graph in time O(n1.5mlog n)

✍ H. Alt; N. Blum; K. Mehlhorn; M. Paul 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Induced matchings in bipartite graphs

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

The most vital edges of matching in a bi

The most vital edges of matching in a bipartite graph

✍ Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 373 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

Maximum matchings in a class of random g

Maximum matchings in a class of random graphs

✍ A.M. Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 630 KB