A faster computation of all the best swap edges of a shortest paths tree (Q893317)
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: A faster computation of all the best swap edges of a shortest paths tree |
scientific article; zbMATH DE number 6511726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster computation of all the best swap edges of a shortest paths tree |
scientific article; zbMATH DE number 6511726 |
Statements
A faster computation of all the best swap edges of a shortest paths tree (English)
0 references
19 November 2015
0 references
single-source shortest paths tree
0 references
edge fault tolerance
0 references
swap algorithms
0 references
0 references
0 references
0.9942145347595216
0 references
0.9376403093338012
0 references
0.9357727766036988
0 references
0.9036298990249634
0 references
