𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the 2-Disjoint Paths Problem in Nearly Linear Time

✍ Scribed by Torsten Tholey

Book ID
105914831
Publisher
Springer
Year
2005
Tongue
English
Weight
380 KB
Volume
39
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The disjoint paths problem in quadratic
The disjoint paths problem in quadratic time
✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi; Bruce Reed πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 187 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

Solving the -shortest path problem with
Solving the -shortest path problem with time windows in a time varying network
✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const