𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum edge-disjoint paths problem in complete graphs

✍ Scribed by Adrian Kosowski

Book ID
108281412
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
426 KB
Volume
399
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Edge-disjoint paths and cycles in n-edge
Edge-disjoint paths and cycles in n-edge-connected graphs
✍ Andreas Huck πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l β‰₯ 0 let g(k, l) be the minimal __n__ β‰₯ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a

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