𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the disjoint paths problem

✍ Scribed by Thành Nguyen

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
163 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Node-to-set disjoint paths problem in st
Node-to-set disjoint paths problem in star graphs
✍ Qian-Ping Gu; Shietung Peng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 567 KB

GivenanodesandasetZ'={t~,..., tk} of k nodes in a k-connected graph, the node-to-set disjoint paths problem is to find k node-disjoint paths pi : s -+ ti, 1 < i < k. In this paper, we give two O(n\*) time algorithms for the node-to-set disjoint paths problem in n-dimensional star graphs G, which are

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

On line disjoint paths of bounded length
On line disjoint paths of bounded length
✍ Geoffrey Exoo 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 105 KB

In a recent paper Lovfisz, Neumann-Lara and Plummer proved some Mengerian theorems for paths of bounded length. In this note the line connectivity analogue of their problem "is considered. In [3] Lovfisz, Neumann-Lara and Plummer considered the problem of extending Monger's theorem to paths of boun