The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099)
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: The partial inverse minimum spanning tree problem when weight increase is forbidden |
scientific article; zbMATH DE number 5234775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The partial inverse minimum spanning tree problem when weight increase is forbidden |
scientific article; zbMATH DE number 5234775 |
Statements
The partial inverse minimum spanning tree problem when weight increase is forbidden (English)
0 references
13 February 2008
0 references
partial inverse problem
0 references
spanning tree
0 references
weight reduction
0 references
polynomial time algorithms
0 references
0 references
0.92492676
0 references
0.9073314
0 references
0.9059907
0 references
0.8955383
0 references
0.8947112
0 references
0.89140123
0 references
0.89122754
0 references
0.8907863
0 references
