Finding a contra-risk path between two nodes in undirected graphs (Q326494)
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 a contra-risk path between two nodes in undirected graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a contra-risk path between two nodes in undirected graphs |
scientific article |
Statements
Finding a contra-risk path between two nodes in undirected graphs (English)
0 references
12 October 2016
0 references
network flows
0 references
anti-risk path
0 references
shortest path problem
0 references
