A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices.
Michael BarbehennPublished in: IEEE Trans. Computers (1998)
Keyphrases
- computational complexity
- computational cost
- worst case
- np hard
- cost function
- search space
- weighted graph
- space complexity
- preprocessing
- optimal solution
- hamiltonian cycle
- objective function
- undirected graph
- learning algorithm
- polynomial time complexity
- random graphs
- graph theoretic
- similarity measure
- memory requirements
- matching algorithm
- expectation maximization
- k means
- graph model
- particle swarm optimization
- edge weights
- minimum spanning tree
- dynamic programming
- search algorithm