Correlation Clustering with Overlaps
The Cluster Editing problem asks for transforming a given graph into a disjoint union of cliques by applying a minimal number of edge-editing operations. The allowed operations include addition of non-existing edges and deletion of existing ones. We study a multi-parameterized version of the problem...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/13449 https://doi.org/10.26756/th.2022.332 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|