A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
Hiroshi NagamochiShigeki KatayamaToshihide IbarakiPublished in: COCOON (1999)
Keyphrases
- experimental evaluation
- preprocessing
- learning algorithm
- search space
- convex hull
- times faster
- k means
- cost function
- dynamic programming
- computational cost
- high accuracy
- matching algorithm
- detection algorithm
- np hard
- objective function
- neural network
- memory efficient
- spanning tree
- graph structure
- square error
- recognition algorithm
- convergence rate
- video data
- clustering method
- expectation maximization
- simulated annealing
- computational complexity
- search algorithm