𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arc-Disjoint Paths in Expander Digraphs

✍ Scribed by Bohman, Tom; Frieze, Alan

Book ID
118181152
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
235 KB
Volume
32
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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
Arc-disjoint arborescences of digraphs
Arc-disjoint arborescences of digraphs
✍ Cai Mao-cheng πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 182 KB

The purpose of this paper is to give a necessary and sufficient condition for a digraph G to contain k arcdisjoint arborescences so that the number rooted at each vertex x of G lies in some prescribed interval which depends on x. A digraph G = (V, E) consists of a vertex set V and an arc set E such