✦ LIBER ✦

Maximum Balanced Flow in a Network

✍ Scribed by Haggai Ilani; Michael Lomonosov

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 123 KB
Volume: 78
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1940

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On multiroute maximum flows in networks

✍ Charu C. Aggarwal; James B. Orlin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract Let __G__ = (__N, A__) be a network with a designated source node __s__, a designated sink node __t__, and a finite integral capacity __u~ij~__ on each arc (__i, j__) ∈ __A__. An elementary __K__‐flow is a flow of __K__ units from __s__ to __t__ such that the flow on each arcis 0 or 1.

Balanced graphs and network flows

✍ Penrice, Stephen G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com

Balanced network flows. VI. Polyhedral d

Balanced network flows. VI. Polyhedral descriptions

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

Balanced network flows. II. Simple augme

Balanced network flows. II. Simple augmentation algorithms

✍ Fremuth-Paeger, Christian; Jungnickel, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k-factor problems

Balanced network flows. V. Cycle-canceli

Balanced network flows. V. Cycle-canceling algorithms

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

Balanced network flows. III. Strongly po

Balanced network flows. III. Strongly polynomial augmentation algorithms

✍ Fremuth-Paeger, Christian; Jungnickel, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

We discuss efficient augmentation algorithms for the maximum balanced flow problem which run in O(nm 2 ) time. More explicitly, we discuss a balanced network search procedure which finds valid augmenting paths of minimum length in linear time. The algorithms are based on the famous cardinality match