ExCC
-
Updated
Sep 18, 2021 - Java
ExCC
Solve graph partitioning problem experimenting IP, CP (ortools) , Tabu search and GA
Project to study distributed graph partitioning techniques by implementing the JaBeJa algorithm using Java. It was evaluated using several graphs 3elt, add20, Twitter, and several modifications to the original algorithm were tested.
This is the source code of the algorithm described in the paper: "On Using Graph Partitioning with Isomorphism Constraint in Procedural Content Generation" presented at PCG Workshop 2017 part of FDG 2017.
Add a description, image, and links to the graph-partitioning topic page so that developers can more easily learn about it.
To associate your repository with the graph-partitioning topic, visit your repo's landing page and select "manage topics."