Name
Abstract | ||
|---|---|---|
As a vertex-disjoint analogue of Edmonds’ arc-disjoint arborescences theorem, it was conjectured that given a directed graph D with a specified vertex r, there are k spanning arborescences rooted at r such that for every vertex v of D the k directed walks from r to v in these arborescences are internally vertex-disjoint if and only if for every vertex v of D there are k internally vertex-disjoint directed walks from r to v. Whitty (1987) [10] affirmatively settled this conjecture for k≤2, and Huck (1995) [6] constructed counterexamples for k≥3, and Huck (1999) [7] proved that the conjecture is true for every k when D is acyclic. In this paper, we generalize these results by using the concept of “convexity” which is introduced by Fujishige (2010) [4]. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.disc.2012.11.006 | Discrete Mathematics |
Keywords | Field | DocType |
Arborescences,Packing,Vertex-disjoint paths,Convex sets | Discrete mathematics,Combinatorics,Convexity,Vertex (geometry),Directed graph,Counterexample,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
313 | 4 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| András Frank | 1 | 753 | 163.71 |
| Satoru Fujishige | 2 | 828 | 96.94 |
| Naoyuki Kamiyama | 3 | 80 | 23.40 |
| naoki katoh | 4 | 1101 | 187.43 |