Branch and cut algorithm for the clique partitioning problem
-
Updated
Apr 28, 2025 - C++
Branch and cut algorithm for the clique partitioning problem
Combo algorithm for community detection in networks
A Branch and Cut Algorithm for CLIQUE PARTITIONING
Algorithms to find optimal partitions by maximizing modularity in community detection and solving clique partitioning problem.
Add a description, image, and links to the clique-partitioning topic page so that developers can more easily learn about it.
To associate your repository with the clique-partitioning topic, visit your repo's landing page and select "manage topics."