✦ LIBER ✦

A network flow algorithm to find an elementary I/O matching

✍ Scribed by Takeo Yamada

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 206 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced network flows. I. A unifying fr

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms

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

We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithm

Balanced network flows. VIII. A revised

Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views