Publication 1998 Issue No. 2 - February Abstract - A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
February 1998 (vol. 47 no. 2)
pp. 263
 ASCII Text x Michael Barbehenn, "A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices," IEEE Transactions on Computers, vol. 47, no. 2, pp. 263, February, 1998.
 BibTex x @article{ 10.1109/12.663776,author = {Michael Barbehenn},title = {A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices},journal ={IEEE Transactions on Computers},volume = {47},number = {2},issn = {0018-9340},year = {1998},pages = {263},doi = {http://doi.ieeecomputersociety.org/10.1109/12.663776},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted VerticesIS - 2SN - 0018-9340SPEPEPD - 263A1 - Michael Barbehenn, PY - 1998KW - Analysis of algorithmsKW - combinatorial problemsKW - data structuresVL - 47JA - IEEE Transactions on ComputersER -

Abstract—Let ${\cal G}(V,\ E)$ be a directed graph in which each vertex has a nonnegative weight. The cost of a path between two vertices in $\cal G$ is the sum of the weights of the vertices on that path. In this paper, we show that, for such graphs, the time complexity of Dijkstra's algorithm, implemented with a binary heap, is ${\cal O}(|E| + |V|\ \log\ |V|).$

Index Terms:
Analysis of algorithms, combinatorial problems, data structures
Citation:
Michael Barbehenn, "A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices," IEEE Transactions on Computers, vol. 47, no. 2, pp. 263, Feb. 1998, doi:10.1109/12.663776