✦ LIBER ✦

An efficient algorithm for the bipartite matching problem

✍ Scribed by Paolo Carraresi; Claudio Sodini

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n) algorithm for the convex b

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Efficient algorithms for finding maximum

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

A randomized algorithm for the on-line w

✍ Béla Csaba; András Pluhár 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 283 KB

An efficient algorithm for some tree mat

✍ Fabrizio Luccio; Linda Pagli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 788 KB

An extension of the bipartite weighted m

✍ Ai-Jia Hsieh; Chin-Wen Ho; Kuo-Chin Fan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Parallel algorithms for bipartite matchi

✍ Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 614 KB