A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (Q3705239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees |
scientific article; zbMATH DE number 3930756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees |
scientific article; zbMATH DE number 3930756 |
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
0.8096938133239746
0 references
0.8006872534751892
0 references
0.7980788946151733
0 references
0.7967041730880737
0 references
