A Note on the Complexity of Dijkstra s Algorithm for Graphs with Weighted Vertices

Michael Barbehenn. A Note on the Complexity of Dijkstra s Algorithm for Graphs with Weighted Vertices. IEEE Transactions on Computers, 47(2):263, 1998.

Authors

Michael Barbehenn

This author has not been identified. Look up 'Michael Barbehenn' in Google