𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A SimplifiedÕ(nm)Time Edge-Splitting Algorithm in Undirected Graphs

✍ Scribed by H. Nagamochi; S. Nakamura; T. Ibaraki

Publisher
Springer
Year
2000
Tongue
English
Weight
141 KB
Volume
26
Category
Article
ISSN
0178-4617

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