Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithm to find anti-risk path between two nodes of an undirected graph |
scientific article |
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
