1 citations · 2 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Bicluster Editing with Overlaps: A Vertex Splitting Approach
Faisal N. Abu-Khzam, Lucas Isenmann, Zeina Merchad
The BiCluster Editing problem aims at editing a given bipartite graph into a disjoint union of bicliques via a minimum number of edge deletion or addition operations. As a graph-ba…
cs.DS2024
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…