✦ LIBER ✦

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

✍ Scribed by Hopcroft, John E.; Karp, Richard M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for maximum matc

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

An O(n log n log log n) parallel maximum

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Finding maximum square-free 2-matchings

✍ David Hartvigsen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Finding maximum matching for bipartite g

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

Efficient algorithms for finding maximum

✍ W. Lipski; F. P. Preparata 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 965 KB

Algorithms for Maximum Independent Set i

✍ José Soares; Marco A. Stefanes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 371 KB