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 this page instead for the normal view: Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs |
scientific article; zbMATH DE number 6329922
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
