The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.
-
Updated
Apr 27, 2024 - Python
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.
Course Project - Foundations of VLSI CAD - Autumn Semester 2022 - Indian Institute of Technology Bombay
VLSI with CAD: Python program which accepts file input and determines the minimum cutset
Heuristic Path Planning is a project dedicated to finding optimal routes efficiently. Applicable across robotics, transportation, and gaming, it offers robust and timely path planning solutions.
Hypergrafic partitioning heuristics of quantum circuits for distributed quantum computing.
Kernighan-Lin Algorithm implementation in python. Kernighan-Lin Algorithm is a graph partitioning algorithm that optimizes the cut size between two subsets of nodes.
Collection of finished mini-projects for Heuristic algorithms course on Faculty
Add a description, image, and links to the kernighan-lin topic page so that developers can more easily learn about it.
To associate your repository with the kernighan-lin topic, visit your repo's landing page and select "manage topics."