✦ LIBER ✦

Finding Edge-Disjoint Paths in Partialk-Trees

✍ Scribed by X. Zhou; S. Tamura; T. Nishizeki

Book ID: 106149269
Publisher: Springer
Year: 2000
Tongue: English
Weight: 339 KB
Volume: 26
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004539910002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Maximum Edge-Disjoint Paths Problem

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

✍ Erlebach, Thomas; Jansen, Klaus 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 310 KB

Finding well-balanced pairs of edge-disj

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs

✍ Jørgen Bang-Jensen; Daniel Gonçalves; Inge Li Gørtz 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Finding Edge-disjoint Paths in Networks:

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm

✍ Maria J. Blesa; Christian Blum 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

Edge-disjoint paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 KB

Edge-Disjoint Paths in Expander Graphs

✍ Frieze, Alan M. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 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.