✦ LIBER ✦

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Scribed by Taenam Kim; Kyung-Yong Chwa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n + m log log n) maximum weig

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An Optimal $O(\log\log n)$ Time Parallel

✍ Breslauer, Dany; Galil, Zvi 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 960 KB

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

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

An O(n2log n) parallel max-flow algorith

✍ Yossi Shiloach; Uzi Vishkin 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 966 KB

An O(n-log-log-n) Time Algorithm for Con

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(n log n) Manhattan path algorithm

✍ Witold Lipski Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 262 KB