Finding an anti-risk path between two nodes in undirected graphs (Q732313): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding an anti-risk path between two nodes in undirected graphs |
scientific article |
Statements
Finding an anti-risk path between two nodes in undirected graphs (English)
0 references
9 October 2009
0 references
shortest path
0 references
shortest path tree
0 references
most vital real time edge
0 references
anti-risk path
0 references
