Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812)
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 algorithm to find anti-risk path between two nodes of an undirected graph |
scientific article; zbMATH DE number 6307089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithm to find anti-risk path between two nodes of an undirected graph |
scientific article; zbMATH DE number 6307089 |
Statements
Faster algorithm to find anti-risk path between two nodes of an undirected graph (English)
0 references
24 June 2014
0 references
graph algorithms
0 references
edge failure
0 references
anti-risk path
0 references
shortest path
0 references
0.94336426
0 references
0.9180959
0 references
0.8375844
0 references
0 references
0 references
0.83675164
0 references
0.8356394
0 references
0.8325365
0 references
