Autor:	Francisco Barahona
Rok vydání:	1995
Předmět:	Discrete mathematics Spanning tree General Mathematics Computation Optimal flow Maximum flow problem Graph theory Management Science and Operations Research Minimum spanning tree Graph Computer Science Applications Combinatorics MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Mathematics of Operations Research. 20:104-115
ISSN:	1526-5471 0364-765X
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::487d5358dc9ce79683c6b2c06c5df773 https://doi.org/10.1287/moor.20.1.104 Zobrazit plný text záznamu Plný text ve formátu PDF