✦ LIBER ✦

On Implementing the Push—Relabel Method for the Maximum Flow Problem

✍ Scribed by B. V. Cherkassky; A. V. Goldberg

Publisher: Springer
Year: 1997
Tongue: English
Weight: 362 KB
Volume: 19
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009180

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Implementation of the Push-Re

A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem

✍ R. Anderson; J.C. Setubal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for

On the complexity of preflow-push algori

On the complexity of preflow-push algorithms for maximum-flow problems

✍ Levent Tunçel 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 342 KB

On the maximum capacity augmentation alg

On the maximum capacity augmentation algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Asymptotic analysis of the flow deviatio

Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

✍ Daniel Bienstock; Olga Raskina 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 129 KB

A note on specialized versus unspecializ

A note on specialized versus unspecialized methods for maximum-flow problems

✍ Fred Glover; Darwin Klingman; Melissa Mead; John Mote 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

On a capacity scaling algorithm for the

On a capacity scaling algorithm for the constrained maximum flow problem

✍ Cenk Çalışkan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB