✦ LIBER ✦

Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits

✍ Scribed by Y.Daniel Liang; Norbert Blum

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

A linear time algorithm for maximum matc

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

Efficient algorithms for finding maximum

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

Maximum matching of given weight in comp

✍ A. V. Karzanov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 641 KB

New results on maximum induced matchings

✍ Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Generation of maximum independent sets o

✍ Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 760 KB