Finding the detour-critical edge of a shortest path between two nodes (Q293313): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
| Property / author | |||
| Property / author: Peter Widmayer / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590724 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
shortest path | |||
| Property / zbMATH Keywords: shortest path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fault tolerance | |||
| Property / zbMATH Keywords: fault tolerance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
transient edge failures | |||
| Property / zbMATH Keywords: transient edge failures / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
longest detour | |||
| Property / zbMATH Keywords: longest detour / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
most critical edge | |||
| Property / zbMATH Keywords: most critical edge / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
