✦ LIBER ✦

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

✍ Scribed by Nussbaum, Doron; Pu, Shuye; Sack, Jörg-Rüdiger; Uno, Takeaki; Zarrabi-Zadeh, Hamid

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

Efficient algorithms for finding maximum

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

Parallel maximum independent set in conv

✍ Artur Czumaj; Krzysztof Diks; Teresa M. Przytycka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Finding maximum matching for bipartite g

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

Algorithms for Maximum Independent Set i

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

Finding maximum square-free 2-matchings

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