✦ LIBER ✦

On the complexity of the planar directed edge-disjoint paths problem

✍ Scribed by Dirk Müller

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 278 KB
Volume: 105
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0653-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the planar edge-dis

On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary

✍ Werner Schwärzler 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 363 KB

On the complexity of the disjoint paths

On the complexity of the disjoint paths problem

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 554 KB

On the disjoint paths problem

✍ Thành Nguyen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 163 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

On the complexity of vertex-disjoint len

On the complexity of vertex-disjoint length-restricted path problems

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

Approximations for the Disjoint Paths Pr

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks

✍ Jon Kleinberg; Éva Tardos 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We consider the problem of connecting distinguished terminal pairs in a graph via edge-disjoint paths. This is a classical NP-complete problem for which no general approximation techniques are known; it has recently been brought into focus in papers discussing applications to admission control in hi