Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Authors:
- 1 June 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 83-109
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Matroid Approach to Finding Edge Connectivity and Packing ArborescencesJournal of Computer and System Sciences, 1995
- A Faster Deterministic Maximum Flow AlgorithmJournal of Algorithms, 1994
- Geometric Algorithms and Combinatorial Optimization1988
- Fractional covers for forests and matchingsMathematical Programming, 1984
- A faster algorithm for finding edge-disjoint branchingsInformation Processing Letters, 1983
- Arc‐disjoint arborescences of digraphsJournal of Graph Theory, 1983
- Edge-disjoint branching in directed multigraphsInformation Processing Letters, 1979
- On two minimax theorems in graphJournal of Combinatorial Theory, Series B, 1976
- A good algorithm for edge-disjoint branchingInformation Processing Letters, 1974
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965