Swapping a failing edge of a single source shortest paths tree is good and fast (Q1566374)
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: Swapping a failing edge of a single source shortest paths tree is good and fast |
scientific article; zbMATH DE number 1922431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Swapping a failing edge of a single source shortest paths tree is good and fast |
scientific article; zbMATH DE number 1922431 |
Statements
Swapping a failing edge of a single source shortest paths tree is good and fast (English)
0 references
2 June 2003
0 references
network survivability
0 references
single source shortest paths tree
0 references
swap algorithms
0 references
