A theorem on the expected complexity of dijkstra's shortest path algorithm (Q3696517): 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.1016/0196-6774(85)90009-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010601538 / rank | |||
Normal rank | |||
Latest revision as of 21:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A theorem on the expected complexity of dijkstra's shortest path algorithm |
scientific article |
Statements
A theorem on the expected complexity of dijkstra's shortest path algorithm (English)
0 references
1985
0 references
single-source shortest path problem
0 references
decision tree
0 references
