An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961)
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: An improved algorithm for computing all the best swap edges of a tree spanner |
scientific article; zbMATH DE number 7188811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for computing all the best swap edges of a tree spanner |
scientific article; zbMATH DE number 7188811 |
Statements
An improved algorithm for computing all the best swap edges of a tree spanner (English)
0 references
9 April 2020
0 references
transient edge failure
0 references
swap algorithm
0 references
tree spanner
0 references
0 references
1.0000001
0 references
0.9761232
0 references
0.96358055
0 references
0.9401613
0 references
0.9401613
0 references
0.93337655
0 references
0.92284703
0 references
0.9090424
0 references
