✦ LIBER ✦

Maintaining bipartite matchings in the presence of failures

✍ Scribed by Edwin Hsing-Mean Sha; Kenneth Steiglitz

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 1013 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230503

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in random superpositions of bi

Matchings in random superpositions of bipartite trees

✍ E.M. Palmer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 540 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

An extension of the bipartite weighted m

An extension of the bipartite weighted matching problem

✍ Ai-Jia Hsieh; Chin-Wen Ho; Kuo-Chin Fan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 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

Optimizing over a slice of the bipartite

Optimizing over a slice of the bipartite matching polytope

✍ Matthias Leclerc 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 322 KB

An addendum to the most vital edges of m

An addendum to the most vital edges of matching in a bipartite graph

✍ Volgenant, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB 👁 2 views