Keyphrases
- computational complexity
- learning algorithm
- experimental evaluation
- space complexity
- memory requirements
- polynomial time complexity
- undirected graph
- times faster
- optimization algorithm
- expectation maximization
- dynamic programming
- random graphs
- preprocessing
- shortest path problem
- spanning tree
- recognition algorithm
- maximum flow
- objective function
- detection algorithm
- matching algorithm
- np complete
- simulated annealing
- cost function
- np hard
- finding the shortest path
- optimal solution
- adjacency graph
- randomized algorithm
- graph search
- minimum spanning tree
- computational cost
- worst case
- graph model
- segmentation algorithm
- convergence rate