Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11750-007-0033-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057524007 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 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
