Keyphrases
- np hard
- dynamic programming
- computational complexity
- graph structure
- k means
- method finds
- optimal solution
- graph model
- learning algorithm
- conflict free
- polynomial time complexity
- input data
- undirected graph
- segmentation algorithm
- detection algorithm
- clustering method
- cost function
- graph search
- equivalence class
- convex hull
- spanning tree
- expectation maximization
- preprocessing
- minimum spanning tree
- simulated annealing
- worst case
- maximum flow
- strongly connected
- graph based algorithm
- probability distribution
- vertex set
- probabilistic model
- independent set
- minimal length