Kernighan–Lin algorithm
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs.The algorithm has important practical application in the layout of digital circuits and components in electronic design automation of VLSI.
- Comment
- enThe Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs.The algorithm has important practical application in the layout of digital circuits and components in electronic design automation of VLSI.
- Has abstract
- enThe Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs.The algorithm has important practical application in the layout of digital circuits and components in electronic design automation of VLSI.
- Is primary topic of
- Kernighan–Lin algorithm
- Label
- enKernighan–Lin algorithm
- Link from a Wikipage to another Wikipage
- Category:Combinatorial algorithms
- Category:Combinatorial optimization
- Category:Heuristic algorithms
- Electronic design automation
- Fiduccia–Mattheyses algorithm
- Graph partition
- Greedy algorithm
- Heuristic (computer science)
- Undirected graph
- VLSI
- SameAs
- 2cC5R
- Algorithme de Kernighan-Lin
- Algoritmo di Kernighan-Lin
- Algorytm Kernighana-Lina
- Kernighan-Lin
- Kernighan-Lin-Algorithmus
- m.064prsg
- Q2802593
- Subject
- Category:Combinatorial algorithms
- Category:Combinatorial optimization
- Category:Heuristic algorithms
- WasDerivedFrom
- Kernighan–Lin algorithm?oldid=1064768118&ns=0
- WikiPageLength
- 4314
- Wikipage page ID
- 23174224
- Wikipage revision ID
- 1064768118
- WikiPageUsesTemplate
- Template:About
- Template:Math
- Template:Mvar
- Template:Reflist