A new algorithm for the shortest‐path problem
Copyright policy ) Amr Elmasry; Ahmed Shokry;
A new algorithm for the shortest‐path problem
AbstractIn this article we propose a new single‐source shortest‐path algorithm that achieves the same O(n · m) time bound as the Bellman‐Ford‐Moore algorithm but outperforms it and other state‐of‐the‐art algorithms in many cases in practice. Our claims are supported by experimental evidence.
- Alexandria University Egypt
admissible graph, combinatorial algorithms, shortest paths, Graph algorithms (graph-theoretic aspects), labeling methods, practical efficiency, Programming involving graphs or networks, negative cycles
admissible graph, combinatorial algorithms, shortest paths, Graph algorithms (graph-theoretic aspects), labeling methods, practical efficiency, Programming involving graphs or networks, negative cycles
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 3
Average
Average
Average
Fields of Science (4) View all
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?