The color-balanced spanning tree problem. (Q5389837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6027052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The color-balanced spanning tree problem. |
scientific article; zbMATH DE number 6027052 |
Statements
23 April 2012
0 references
spanning tree
0 references
matroids
0 references
polynomial algorithms
0 references
NP-completeness
0 references
edge partition
0 references
0.8209677934646606
0 references
0.8058125972747803
0 references
0.7916282415390015
0 references
0.7771234512329102
0 references
0.7716911435127258
0 references
