Correlation Clustering via 2-Club Clustering with Vertex Splitting
In the realm of graph theory, correlation cluster is studied as a graph modification problem known under "Cluster Editing." In this problem, we apply a sequence of k edge (or vertex) additions and/or deletions so the graph becomes a topological sum of clusters. At first, a cluster was cons...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2024
|
| Online Access: | http://hdl.handle.net/10725/16685 https://doi.org/10.26756/th.2023.765 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|