Finding the detour-critical edge of a shortest path between two nodes (Q293313)
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: Finding the detour-critical edge of a shortest path between two nodes |
scientific article; zbMATH DE number 6590724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the detour-critical edge of a shortest path between two nodes |
scientific article; zbMATH DE number 6590724 |
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
0.8664203882217407
0 references
0.8116357326507568
0 references
0.8106769919395447
0 references
0.8083841800689697
0 references
