✦ LIBER ✦

Finding maximum square-free 2-matchings in bipartite graphs

✍ Scribed by David Hartvigsen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding maximum matching for bipartite g

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

On maximum induced matchings in bipartit

✍ V.V. Lozin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Finding all the perfect matchings in bip

✍ K. Fukuda; T. Matsui 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Efficient algorithms for finding maximum

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

An $n^{5/2} $ Algorithm for Maximum Matc

✍ Hopcroft, John E.; Karp, Richard M. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

Finding all minimum-cost perfect matchin

✍ Komei Fukuda; Tomomi Matsui 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB