Finding the detour-critical edge of a shortest path between two nodes (Q293313): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q539451 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The k most vital arcs in the shortest path problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on finding the bridges of a graph / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980494375 / rank | |||
Normal rank | |||
Latest revision as of 11:59, 30 July 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
