1 paper
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…