Finding the detour-critical edge of a shortest path between two nodes (Q293313): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the detour-critical edge of a shortest path between two nodes |
scientific article |
Statements
Finding the detour-critical edge of a shortest path between two nodes (English)
0 references
9 June 2016
0 references
shortest path
0 references
fault tolerance
0 references
transient edge failures
0 references
longest detour
0 references
most critical edge
0 references
