Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599)
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: Computational experiments with a lazy version of a K quickest simple path ranking algorithm |
scientific article; zbMATH DE number 5277456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm |
scientific article; zbMATH DE number 5277456 |
Statements
Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (English)
0 references
20 May 2008
0 references
graph algorithms
0 references
networks
0 references
quickest path
0 references
ranking
0 references
0.85208660364151
0 references
0.8506872653961182
0 references
0.8498032093048096
0 references
0.8464789986610413
0 references
0.8449214696884155
0 references
