Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6329922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs |
scientific article; zbMATH DE number 6329922 |
Statements
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (English)
0 references
13 August 2014
0 references
replacement paths
0 references
detour critical edge
0 references
shortest path
0 references
0 references
0.911501407623291
0 references
0.8744377493858337
0 references
0.8705132603645325
0 references
0.8368338942527771
0 references
0.8351615071296692
0 references
