Shortest paths algorithms¶
Cherkassky, G., & Radzik. (1996). Shortest paths algorithms: Theory and experimental evaluation.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Heap
- The binary heap in an array remains the practical default for most scheduling, simulation, and graph-algorithm uses
This sourceAn experimental comparison of shortest-path algorithms and their priority-queue implementations.
- The binary heap in an array remains the practical default for most scheduling, simulation, and graph-algorithm uses
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:60494f4715bb · see in the full table