𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for edge-disjoint paths in planar graphs

✍ Scribed by Dorothea Wagner; Karsten Weihe

Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
1007 KB
Volume
15
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple linear algorithm for the edge-d
A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs
✍ Laurent Coupry πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 400 KB

Let G = (v!E) be an undirected planar graph, and s, 1 E V, s # f. We present a linear algorithm to compute a set of edge-disjoint (s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to r in a non-weighted graph. The main purpose is not to show

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