The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
Benchmarks for Grid-Based Pathfinding
Sturtevant, N. R. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2197681 · Cited by 549
Exact Routing in Large Road Networks Using Contraction Hierarchies
Geisberger, R., Sanders, P., Schultes, D., & Vetter, C. (2012) · Transportation Science · doi:10.1287/trsc.1110.0401 · Cited by 323
Self-citationManaging Electric Vehicles in the Smart Grid Using Artificial Intelligence: A Survey
Rigas, E. S., Ramchurn, S. D., & Bassiliades, N. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2376873 · Cited by 280
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Self-citationCruising with a Battery-Powered Vehicle and Not Getting Stranded
Storandt, S., & Funke, S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8326 · Cited by 35
Metadata
- Authors
- Geisberger, R., Sanders, P., Schultes, D., & Delling, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-05-28
- Pages
- 319-333
- OpenAlex
- W2148831787
- Cited by
- 714
- References
- 1
- FWCI
- 23.19
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. https://app.cochat.ai/papers/10.1007/978-3-540-68552-4_24
- The paper
- Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008). Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-68552-4_24
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
