Packing Spanning Trees
- 1 February 1995
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 20 (1) , 104-115
- https://doi.org/10.1287/moor.20.1.104
Abstract
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.Keywords
This publication has 0 references indexed in Scilit: