A Dynamic Algorithm for Maintaining Graph Partitions.
Lyudmil AleksandrovHristo N. DjidjevPublished in: SWAT (2000)
Keyphrases
- optimization algorithm
- worst case
- cost function
- experimental evaluation
- detection algorithm
- simulated annealing
- graph structure
- significant improvement
- recognition algorithm
- high accuracy
- computational cost
- k means
- search space
- learning algorithm
- matching algorithm
- clustering algorithm
- breadth first search
- tree structure
- graph based algorithm
- np hard
- preprocessing
- optimal solution
- ant colony optimization
- segmentation algorithm
- dynamic programming
- bipartite graph
- spanning tree
- image sequences
- adjacency graph