Packing Spanning Trees
Francisco Barahona · Mathematics of Operations Research · 1995
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.