Finding best swap edges minimizing the routing cost of a spanning tree (Q476426)
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: Finding best swap edges minimizing the routing cost of a spanning tree |
scientific article; zbMATH DE number 6375632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding best swap edges minimizing the routing cost of a spanning tree |
scientific article; zbMATH DE number 6375632 |
Statements
Finding best swap edges minimizing the routing cost of a spanning tree (English)
0 references
2 December 2014
0 references
graph algorithms
0 references
minimum routing-cost spanning tree
0 references
transient edge failures
0 references
all-best swap edges problems
0 references
0 references
0 references
0 references
0 references
0 references
0.992346465587616
0 references
0.9067822098731996
0 references
0.8883023262023926
0 references
0.8883023262023926
0 references
0.8826022744178772
0 references
