A surname from Irish.

plural of Kernighan

(computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.

(computing theory) In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour.