Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms.
Thang Nguyen BuiC. HeighamCurt JonesFrank Thomson LeightonPublished in: DAC (1989)
Keyphrases
- simulated annealing
- graph theory
- data structure
- computational cost
- hybrid algorithm
- computational complexity
- special case
- learning algorithm
- optimization methods
- theoretical analysis
- random walk
- data mining
- computational efficiency
- combinatorial optimization
- significant improvement
- depth first search
- stochastic search
- maximum clique