๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Tree metrics and edge-disjoint\(S\)-paths

โœ Scribed by Hirai, Hiroshi; Pap, Gyula

Book ID
121615079
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
614 KB
Volume
147
Category
Article
ISSN
0025-5610

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 in Expander Graphs
Edge-Disjoint Paths in Expander Graphs
โœ Frieze, Alan M. ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 170 KB