A faster computation of the most vital edge of a shortest path (Q1603442)
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 the most vital edge of a shortest path |
scientific article; zbMATH DE number 1767326
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster computation of the most vital edge of a shortest path |
scientific article; zbMATH DE number 1767326 |
Statements
A faster computation of the most vital edge of a shortest path (English)
0 references
14 July 2002
0 references
graph algorithms
0 references
shortest path
0 references
most vital edge
0 references
transient failure
0 references
replacement shortest path
0 references
0.9363484
0 references
0 references
0.8894042
0 references
0.88858414
0 references
0.8863631
0 references
0.88519585
0 references
0 references
0 references
