An efficient heuristic procedure for partitioning graphs.
Brian W. KernighanShen LinPublished in: Bell Syst. Tech. J. (1970)
Keyphrases
- graph partitioning
- search procedure
- optimal solution
- search algorithm
- minimum spanning tree
- simulated annealing
- graph theoretic
- forward selection
- maximum independent set
- graph theory
- graph matching
- mixed integer program
- partitioning algorithm
- branch and bound procedure
- spectral graph
- bipartite graph
- tabu search
- duplicate detection
- graph kernels
- graph search