The Kernighan-Lin algorithm is a heuristic method for finding good partitions of a graph. It has important practical application in the layout of digital circuits and components during electronic design automation for very large scale integration. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Sources
1. Wikipedia: Kernighan-Lin algorithm
entity record, description (design-technique)Quote, entity record, description (design-technique)
The Kernighan-Lin algorithm is a heuristic method for finding good partitions of a graph.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.