Faster swap edge computation in minimum diameter spanning trees (Q2428664)
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: Faster swap edge computation in minimum diameter spanning trees |
scientific article; zbMATH DE number 6028420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster swap edge computation in minimum diameter spanning trees |
scientific article; zbMATH DE number 6028420 |
Statements
Faster swap edge computation in minimum diameter spanning trees (English)
0 references
26 April 2012
0 references
graph algorithms
0 references
minimum diameter spanning tree
0 references
transient edge failures
0 references
fault tolerance
0 references
0 references
0 references
0 references
0.994365692138672
0 references
0.9646511673927308
0 references
0.8761303424835205
0 references
0.838040828704834
0 references
