✦ LIBER ✦

Matchings in random superpositions of bipartite trees

✍ Scribed by E.M. Palmer

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 540 KB
Volume: 41
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90249-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in random regular bipartite di

Matchings in random regular bipartite digraphs

✍ David W. Walkup 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 505 KB

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

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

Maintaining bipartite matchings in the p

Maintaining bipartite matchings in the presence of failures

✍ Edwin Hsing-Mean Sha; Kenneth Steiglitz 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1013 KB

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

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