✦ LIBER ✦

Induced disjoint paths problem in a planar digraph

✍ Scribed by Yusuke Kobayashi

Book ID: 108112832
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 663 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.06.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint Paths in Acyclic Digraphs

✍ A. Metzlar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 455 KB

A linear time algorithm for the induced

A linear time algorithm for the induced disjoint paths problem in planar graphs

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Arc-Disjoint Paths in Expander Digraphs

✍ Bohman, Tom; Frieze, Alan 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB

Edge-disjoint paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 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

Disjoint Paths in a Planar Graph—A Gener

Disjoint Paths in a Planar Graph—A General Theorem

✍ Ding, Guoli; Schrijver, A.; Seymour, P. D. 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 521 KB