𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

✍ Scribed by U. Brandes and D. Wagner

Book ID
120137119
Publisher
Springer
Year
2000
Tongue
English
Weight
232 KB
Volume
28
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Vertex-Disjoint Menger Problem in Pl
The Vertex-Disjoint Menger Problem in Planar Graphs
✍ Ripphausen-Lipa, Heike; Wagner, Dorothea; Weihe, Karsten πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 357 KB
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