A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
Hiroshi NagamochiShigeki KatayamaToshihide IbarakiPublished in: J. Comb. Optim. (2000)
Keyphrases
- experimental evaluation
- times faster
- search space
- high accuracy
- preprocessing
- learning algorithm
- significant improvement
- matching algorithm
- objective function
- dynamic programming
- np hard
- optimal solution
- probabilistic model
- simulated annealing
- expectation maximization
- segmentation algorithm
- detection algorithm
- k means
- graph construction
- minimum length
- memory efficient
- adjacency graph
- undirected graph
- highly efficient
- recognition algorithm
- tree structure
- worst case
- cost function
- bayesian networks