3 papers
cs.CC2025
On the Complexity of Claw-Free Vertex Splitting
Faisal N. Abu-Khzam, Sergio Thoumi
Vertex splitting consists of taking a vertex in a graph and replacing it with two non-adjacent vertices whose combined neighborhoods is the neighborhood of . The split is sa…
cs.DS2025
On the Complexity of 2-club Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann +1
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each…
cs.SI2024
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different gro…