✦ LIBER ✦

Disjoint shortest paths in graphs

✍ Scribed by Hikoe Enomoto; Akira Saito

Book ID: 110564191
Publisher: Springer-Verlag
Year: 1984
Tongue: English
Weight: 250 KB
Volume: 4
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579137

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in euclidean graphs

✍ Robert Sedgewick; Jeffrey Scott Vitter 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 971 KB

Shortest Paths in Reachability Graphs

✍ J. Desel; J. Esparza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Edge-disjoint paths in planar graphs

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

Disjoint Paths in Graphs III, Characteri

Disjoint Paths in Graphs III, Characterization

✍ Xingxing Yu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 326 KB

Disjoint T-paths in tough graphs

✍ Tomáš Kaiser 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

## Abstract Let __G__ be a graph and __T__ a set of vertices. A __T‐path__ in __G__ is a path that begins and ends in __T__, and none of its internal vertices are contained in __T__. We define a __T‐path covering__ to be a union of vertex‐disjoint __T__‐paths spanning all of __T__. Concentrating on

Edge-Disjoint Paths in Expander Graphs

✍ Frieze, Alan M. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB