Rooted k-connections in digraphs

Discrete Applied Mathematics

Volumn 157, Issue 6, 2009, Pages 1242-1254

  Frank, András ^a  

^a MTA ELTE Egervary Research Group   (Hungary)

Author keywords

Arborescences; Connectivity of digraphs; Matroid intersection

Indexed keywords

ALGEBRA; GRAPH THEORY; INTERSECTIONS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

ARBORESCENCES; COMBINATORIAL STRUCTURES; CONNECTIVITY OF DIGRAPHS; DIRECTED GRAPHS; DISJOINT PATHS; EDGE-DISJOINT PATHS; MATROID; MATROID INTERSECTION; MATROID THEORIES; MATROIDS; MINIMUM COSTS; NETWORK PROBLEMS; NEW YORK; POLYNOMIAL-TIME; SUBGRAPH; SUBMODULAR FLOWS; SUBMODULAR FUNCTIONS; SUPERMODULAR FUNCTIONS;

COSTS;

EID: 61549100860     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.03.040     Document Type: Article

References (27)

1. Chu Y.-J., and Liu T.-H. On the shortest arborescence of a directed graph. Sci. Sinica XIV 10 (1965) 1396-1400
2. Edmonds J. Submodular functions, matroids, and certain polyhedra. In: Guy R., Hanani H., Sauer N., and Schönheim J. (Eds). Combinatorial Structures and their Applications (1970), Gordon and Breach, New York 69-87
3. Edmonds J. Minimum partition of a matroid into independent sets. J. Res. Nat. Bur. Standards Sect. 869 (1965) 67-72
4. Edmonds J. Edge-disjoint branchings. In: Rustin B. (Ed). Combinatorial Algorithms (1973), Acad. Press, New York 91-96
5. Edmonds J. Matroid intersection. Ann. Discrete Math. 4 (1979) 39-49
6. Edmonds J., and Fulkerson D.R. Transversals and matroid partition. J. Res. Nat. Bur. Standards (B) 69 (1965) 147-153
7. Edmonds J., and Giles R. A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1 (1977) 185-204
8. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton Univ. Press, Princeton NJ
9. Fulkerson D.R. Packing rooted directed cuts in a weighted directed graph. Math. Program. 6 (1974) 1-13
10. Frank A. Kernel systems of directed graphs. Acta Sci. Math. (Szeged) 41 1-2 (1979) 63-76
11. Frank A. A weighted matroid intersection algorithm. J. Algorithms 2 (1981) 328-336
12. Frank A. Generalized polymatroids. Finite and Infinite Sets (Eger). Colloquia Mathematica Soc. J. Bolyai vol. 37 (1981), North-Holland 285-294
13. Frank A., and Tardos É. An application of submodular flows. Linear Algebra Appl. 114-115 (1989) 329-348
14. Frank A. Increasing the rooted connectivity of a digraph by one. In: Frank A. (Ed). Connectivity Augmentation of Networks: Structures and Algorithms, Mathematical Programming, Ser. B, vol. 84, No. 3 (1999) 565-576
15. Frank A. Submodular flows. In: Pulleyblank W. (Ed). Progress in Combinatorial Optimization (1984), Academic Press 147-165
16. Fujishige S. Submodular Functions and Optimization. second ed. Annals of Discrete Mathematics vol. 58 (2005), Elsevier
17. Ghouila-Houri A. Caractérisation des matrices totalement unimodulaires. C. R. Hebdomadaires des Séances de l'Acad. Sci. [Paris] 254 (1962) 1192-1194
18. Hakimi S.L. On the degrees of the vertices of a directed graph. J. Franklin Inst. 279 4 (1965) 290-308
19. Imai H. On combinatorial structures of line drawings of polyhedra. Discrete Appl. Math. 10 (1985) 79-92
20. Lovász L. On two minimax theorems in graph theory. J. Combin. Theory (B) 21 (1976) 96-103
21. Nash-Williams C.St.J.A. Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964) 12
22. Schrijver A. Total dual integrality from directed graphs, crossing families and sub- and supermodular functions. In: Pulleyblank W.R. (Ed). Progress in Combinatorial Optimization (1984), Academic Press 315-361
23. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. Series Algorithms and Combinatorics vol. 24 (2003), Springer
24. Sugihara K. Machine Interpretation of Line Drawings (1986), The MIT Press
25. Sugihara K. Detection of structural inconsistency in systems of equations with degrees of freedom and its applications. Discrete Appl. Math. 10 (1985) 312-328
26. Tarjan R.E. A good algorithm for edge-disjoint branching. Inform. Process. Lett. 3 (1974) 52-53
27. Whiteley W. Some matroids from discrete applied geometry. In: Bonin J.E., Oxley J.G., and Servatius B. (Eds). Matroid Theory. Contemp. Math. vol. 197 (1996), Amer. Math. Soc., Providence, RI 171-311