Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 73

The DOI matches its Crossref record.

The Improved Dijkstra’s Shortest Path Algorithm and Its Application

Shu-Xi, Wang · 2012 · Procedia Engineering

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.proeng.2012.01.110

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

No references could be resolved yet.

Research works printed but not linked: 8

  1. Geng Su-Yun, “Discrete Mathematics”(4th edition), Tsinghua University Press, 2008.3.
  2. Zhang Yi, Application of Improved Dijkstra Algorithm in Multicast Routing Problem, Journal of Computer Science, 2009.8.
  3. Zhang Jin-Yang, Optimization of the Dijkstra shortest route algorithm, Journal of Science of Surveying and Mapping, 2009.9.
  4. Ku Xiang-Yang, The Shortest Path Algorithm With Constraints, Journal of ComputerApp lications and Software, 2009.5.
  5. Wang Hai-Xiao, Dijkstra Algorithm in the Shortest Path of Logistics Transporting, Journal of Value Engineering, 2009.5.
  6. Liu Ping, An algorithm of shortest paths based on dijkstra algorithm, Journal of Value Engineering, 2008.1.
  7. Li Jing-Jing, Analysis of Shortest Path Algorithms in Intelligent Traffic System. Journal of Computer, 2009.4.
  8. Gu Yun-Yun, Optimization For The Shortest Path Search Algorithm, Journal of ComputerApplications, 2008.4.

Cited by

Metadata

Authors
Shu-Xi, W.
Venue
Procedia Engineering
Publisher
Elsevier BV
Published
2012
Volume
29
Pages
1186-1190
ISSN
1877-7058
Cited by
73
References
0
Language
en
Licence

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: The Improved Dijkstra’s Shortest Path Algorithm and Its Application. https://app.cochat.ai/papers/10.1016/j.proeng.2012.01.110
The paper
Shu-Xi, W. (2012). The Improved Dijkstra’s Shortest Path Algorithm and Its Application. Procedia Engineering. https://doi.org/10.1016/j.proeng.2012.01.110

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.