Kernighan-Lin-Scratch-code-for-graph-partitioning

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.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ambirpatel%2FKernighan-Lin-Scratch-code-for-graph-partitioning

Stars: 5
Forks: 1
Open issues: 0

License: None
Language: Python
Size: 54.7 KB
Dependencies parsed at: Pending

Created at: over 5 years ago
Updated at: about 1 year ago
Pushed at: about 1 year ago
Last synced at: about 1 year ago

Topics: graph-partitioning, kernighan-lin

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Repos

GitHub / ambirpatel / Kernighan-Lin-Scratch-code-for-graph-partitioning