Is Your Graph Algorithm Eligible for Nondeterministic Execution?
Zhiyuan ShaoLin HouYan AiYu ZhangHai JinPublished in: ICPP (2015)
Keyphrases
- optimization algorithm
- experimental evaluation
- times faster
- detection algorithm
- preprocessing
- k means
- cost function
- learning algorithm
- graph structure
- graph model
- high accuracy
- np hard
- significant improvement
- computational complexity
- optimal solution
- recognition algorithm
- convergence rate
- worst case
- minimum spanning tree
- graph based algorithm
- simulated annealing
- dynamic programming
- objective function
- breadth first search
- polynomial time complexity
- weighted graph
- tree structure
- segmentation algorithm
- random walk
- linear programming
- probabilistic model