✦ LIBER ✦

The Vertex-Disjoint Menger Problem in Planar Graphs

✍ Scribed by Ripphausen-Lipa, Heike; Wagner, Dorothea; Weihe, Karsten

Book ID: 118177350
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 357 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539793253565

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear Time Algorithm for the Arc Disj

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

✍ U. Brandes and D. Wagner 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 232 KB

Gossiping in Vertex-Disjoint Paths Mode

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs

✍ J. Hromkovic; R. Klasing; E.A. Stohr; H. Wagener 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 903 KB

Vertex-disjoint paths and edge-disjoint

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

✍ R. W. Whitty 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

Improved algorithms for finding length-b

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Two vertex-disjoint cycles in a graph

✍ Hong Wang 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 499 KB

Vertex-disjoint chorded cycles in a grap

Vertex-disjoint chorded cycles in a graph

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB