Finding an anti-risk path between two nodes in undirected graphs (Q732313)
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 an anti-risk path between two nodes in undirected graphs |
scientific article; zbMATH DE number 5612783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding an anti-risk path between two nodes in undirected graphs |
scientific article; zbMATH DE number 5612783 |
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
0.8948759436607361
0 references
0.8865366578102112
0 references
0.7764750123023987
0 references
0.7541732788085938
0 references
0.7525266408920288
0 references
