✦ LIBER ✦

A linear time algorithm for maximum matchings in convex, bipartite graphs

✍ Scribed by G. Steiner; J.S. Yeomans

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matching in a convex bipartite g

✍ Fred Glover 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

Finding maximum matching for bipartite g

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

A linear algorithm for bipartition of bi

✍ Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A parametric maximum flow algorithm for

✍ Y.L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Computing a maximum cardinality matching

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

A linear time algorithm for graph partit

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB