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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Isolating the vertices of graph into sets of definite sizes so that the number of edges crossing between sets is minimum is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E… (More)
  • table 1
Is this relevant?
2013
2013
Partitioning in automated VLSI design is utilized to minimize the interconnects between partitions, area, propagation delay… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2010
2010
The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem… (More)
  • figure 1
  • figure 3
  • figure 5
  • table 1
  • figure 6
Is this relevant?
2006
2006
We show that the Kernighan–Lin like linear time heuristic for bipartitioning unweighted graphs by Fiduccia and Mattheyses can be… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The graph partitioning problem is that of dividing the vertices of a graph into sets of specified sizes such that few edges cross… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The graph partitioning problem is that of dividing the vertices of a graph into sets of specified sizes such that few edges cross… (More)
Is this relevant?
1993
1993
In this paper we present a very efficient graph partitioning scheme Quick_Cut that uses the basic strategy of the Kernighan-Lin… (More)
Is this relevant?