The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Highway Hierarchies Hasten Exact Shortest Path Queries
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 note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Stoer, J. (1999) · Springer-Lehrbuch · doi:10.1007/978-3-662-09021-3 · Cited by 2,059
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks.
Gutman, R. J. (2004) · Cited by 215
Using Multi-level Graphs for Timetable Information in Railway Systems
Schulz, F., Wagner, D., & Zaroliagis, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45643-0_4 · Cited by 108
Acceleration of Shortest Path and Constrained Shortest Path Computation
Köhler, E., Möhring, R. H., & Schilling, H. (2005) · Lecture notes in computer science · doi:10.1007/11427186_13 · Cited by 92
Using Multi-Level Graphs for Timetable Information
Schulz, F., Wagner, D., & Zaroliagis, C. (2001) · Cited by 57
Cited by
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Self-citationRoute Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Self-citationEngineering Route Planning Algorithms
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02094-0_7 · Cited by 454
Self-citationExact 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-citationA Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20662-7_20 · Cited by 254
Metadata
- Authors
- Sanders, P., & Schultes, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 568-579
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1493214567
- Cited by
- 327
- References
- 7
- FWCI
- 13.28
- 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: Highway Hierarchies Hasten Exact Shortest Path Queries. https://app.cochat.ai/papers/10.1007/11561071_51
- The paper
- Sanders, P., & Schultes, D. (2005). Highway Hierarchies Hasten Exact Shortest Path Queries. Lecture Notes in Computer Science. https://doi.org/10.1007/11561071_51
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.