✦ LIBER ✦

Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems

✍ Scribed by W. Lipski; F. P. Preparata

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

Finding maximum matching for bipartite g

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

Efficient algorithms for finding depth-f

✍ C. Rhee; Y.Daniel Liang; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 512 KB