𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Levent Tunçel

Publisher
Springer
Year
1994
Tongue
English
Weight
342 KB
Volume
11
Category
Article
ISSN
0178-4617

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

A capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of