The cluster editing problem is a decision problem that, for a graph G and a parameter k, determines if one can apply at most k edge insertion/deletion operations on G so that the resulting graph becomes a union of disjoint cliques.
This repository contains the code and experiments related to the final project for the course Bio-Inspired Artificial Intelligence at the University of Trento.
Add a description, image, and links to the cluster-editing topic page so that developers can more easily learn about it.
To associate your repository with the cluster-editing topic, visit your repo's landing page and select "manage topics."