๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs

โœ Scribed by Laurent Coupry

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
400 KB
Volume
64
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 that this problem can be solved by a linear algorithm, since such an algorithm was recently presented by , but to propose a linear algorithm easier to understand and to justify, and implemented much more easily than Weihe's. @

๐Ÿ“œ SIMILAR VOLUMES

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