Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:36, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm |
scientific article |
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
