A faster computation of the most vital edge of a shortest path (Q1603442): Difference between revisions
From MaRDI portal
Latest revision as of 11:55, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster computation of the most vital edge of a shortest path |
scientific article |
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