# Kernighan–Lin algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- International Conference on Communication and…
- 2017

Isolating the vertices of graph into sets of definite sizes so that the number of edges crossing between sets is minimum is… (More)

Is this relevant?

2014

2014

- 2014

It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E… (More)

Is this relevant?

2013

2013

- 2013

Partitioning in automated VLSI design is utilized to minimize the interconnects between partitions, area, propagation delay… (More)

Is this relevant?

2010

2010

- European Journal of Operational Research
- 2010

The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Math. Program. Comput.
- 2009

Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem… (More)

Is this relevant?

2006

2006

- Oper. Res. Lett.
- 2006

We show that the Kernighan–Lin like linear time heuristic for bipartitioning unweighted graphs by Fiduccia and Mattheyses can be… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- European Journal of Operational Research
- 2000

This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 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

- Proceedings of the IEEE/ACM SC95 Conference
- 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

- ICCAD
- 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?