Packing spanning-trees

Packing spanning-trees

0.00 Avg rating0 Votes
Article ID: iaor20032958
Country: United States
Volume: 20
Issue: 1
Start Page Number: 104
End Page Number: 115
Publication Date: Feb 1995
Journal: Mathematics of Operations Research
Authors:
Keywords: graphs
Abstract:

We are 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.

Reviews

Required fields are marked *. Your email address will not be published.