A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (Q3705239)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees |
scientific article |
Statements
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (English)
0 references
1985
0 references
undirected graph
0 references
edge-disjoint spanning trees
0 references
minimum total edge cost
0 references
polynomial time
0 references
matroid greedy algorithm
0 references
