𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Potentials in Undirected Graphs and Planar Multiflows

✍ Scribed by Sebo, András

Book ID
118177309
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
503 KB
Volume
26
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing cuts in undirected graphs
Packing cuts in undirected graphs
✍ Alberto Caprara; Alessandro Panconesi; Romeo Rizzi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB
Edge-Disjoint (s, t)-Paths in Undir
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time
✍ Karsten Weihe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

We consider the following problem. Let G s V, E be an undirected planar graph and let s, t g V, s / t. The problem is to find a set of pairwise edge-disjoint paths in G, each connecting s with t, of maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fast