✦ LIBER ✦

Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

✍ Scribed by Abraham P. Punnen; K.P.K. Nair

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving the preemptive bound for the s

✍ F. Della Croce; V. T’kindt 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Improved complexity bounds for location

✍ R. Hassin; A. Tamir 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Balanced network flows. VIII. A revised

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views