Skip to search formSkip to main contentSkip to account menu

Kernighan–Lin algorithm

Known as: Kernighan-Lin, Kernighan–Lin, Kernighan–Lin heuristic 
Kernighan–Lin is a O(n2 log(n)) heuristic algorithm for solving the graph partitioning problem. The algorithm has important applications in the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Combinatorial optimization
Fiduccia-Mattheyses algorithmGraph partitionLin–Kernighan heuristic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
VLSI partitioning using parallel kernighan lin algorithm
Isolating the vertices of graph into sets of definite sizes so that the number of edges crossing between sets is minimum is… 
2015
2015
Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm
The equality generalized traveling salesman problem (E-GTSP) is an extension of the traveling salesman problem (TSP) where the… 
2011
2011
Solving the Bottleneck Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm
The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities… 
2009
2009
Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
Abstract In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure (GRASP), called Multiple Phase… 
2008
2008
Reducing power consumption of embedded processors through register file partitioning and compiler support
  • Xuan GuanYunsi Fei
  • International Conference on Application-Specific…
  • 2008
  • Corpus ID: 10645815
As embedded processors being widely used in specific application domains, such as communications, multimedia, and networking, the… 
2006
2006
A hybrid SVM and supervised learning approach to fuzzy min‐max hyperbox classifiers
Abstract In this paper, a fuzzy min‐max hyperbox classifier is designed to solve M‐class classification problems using a hybrid… 
2005
2005
Power transmission control using distributed max-flow
Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the… 
1995
1995
Circuit partitioning using mean field annealing
1993
1993
A modified Lin-Kernighan traveling-salesman heuristic
1992
1992
Circuit layout through an analogy with neural networks
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)