✦ LIBER ✦

An O(n2log n) parallel max-flow algorithm

✍ Scribed by Yossi Shiloach; Uzi Vishkin

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 966 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90013-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(m log n) algorithm for the max + su

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

A O(nm log(U/n)) time maximum flow algor

A O(nm log(U/n)) time maximum flow algorithm

✍ Antonio Sedeño-Noda; Carlos González-Martín 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

An O(log n) parallel algorithm for const

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A new Karzanov-type O(n3) max-flow algor

A new Karzanov-type O(n3) max-flow algorithm

✍ Gary R. Waissi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 731 KB

A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network m

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

An O(n log n) algorithm for the convex bipartite matching problem

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

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB