A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices

IEEE Transactions on Computers

Volumn 47, Issue 2, 1998, Pages 263-

  Barbehenn, Michael ^a  

^a Motorola GmbH   (Germany)

Author keywords

Analysis of algorithms; Combinatorial problems; Data structures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES;

DIJKSTRA'S ALGORITHM;

GRAPH THEORY;

EID: 0031997974     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.663776     Document Type: Article

References (6)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley, 1974.
2. M. Barbehenn and S. Hutchinson, "Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees," IEEE Trans. Robotics and Automation, vol. 11, no. 2, pp. 198-214, Apr. 1995.
3. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1990.
4. E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
5. M. Fredman and R. Tarjan, "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms," J. ACM, vol. 34, no. 3, pp. 596-615, 1987.
6. P.M. Spira and A. Pan, "On Finding and Updating Spanning Trees and Shortest Paths," SIAM J. Computing, vol. 4, no. 3, pp. 375-380, 1975.