https://github.com/levongh/graph
In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.
https://github.com/levongh/graph
fiduccia-mattheyses graph kernigan-lin partitioning simulated-annealing
Last synced: 28 days ago
JSON representation
In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.
- Host: GitHub
- URL: https://github.com/levongh/graph
- Owner: levongh
- Created: 2017-01-22T13:02:54.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2022-08-04T05:51:37.000Z (about 3 years ago)
- Last Synced: 2024-12-31T08:23:11.112Z (9 months ago)
- Topics: fiduccia-mattheyses, graph, kernigan-lin, partitioning, simulated-annealing
- Language: C++
- Homepage:
- Size: 4.06 MB
- Stars: 4
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files: