On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

06/26/2020
by   Aleksander Figiel, et al.
0

Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of diameter two. This naturally leads to the two NP-hard problems 2-Club Cluster Editing (the allowed editing operations are edge insertion and edge deletion) and 2-Club Cluster Vertex Deletion (the allowed editing operations are vertex deletions). Answering an open question from the literature, we show that 2-Club Cluster Editing is W[2]-hard with respect to the number of edge modifications, thus contrasting the fixed-parameter tractability result for the classic Cluster Editing problem (considering cliques instead of 2-clubs). Then focusing on 2-Club Cluster Vertex Deletion, which is easily seen to be fixed-parameter tractable, we show that under standard complexity-theoretic assumptions it does not have a polynomial-size problem kernel when parameterized by the number of vertex deletions. Nevertheless, we develop several effective data reduction and pruning rules, resulting in a competitive solver, clearly outperforming a standard CPLEX solver in most instances of an established biological test data set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/01/2019

On the Parameterized Cluster Editing with Vertex Splitting Problem

In the Cluster Editing problem, a given graph is to be transformed into ...
research
10/15/2018

Parameterized Dynamic Cluster Editing

We introduce a dynamic version of the NP-hard Cluster Editing problem. T...
research
12/06/2021

Modification-Fair Cluster Editing

The classic Cluster Editing problem (also known as Correlation Clusterin...
research
10/18/2019

Cluster Editing parameterized above the size of a modification-disjoint P_3 packing is para-NP-hard

Given a graph G=(V,E) and an integer k, the Cluster Editing problem asks...
research
09/26/2017

A Parameterized View on Multi-Layer Cluster Editing

In classical Cluster Editing we seek to transform a given graph into a d...
research
07/02/2021

An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion

A 2-club is a graph of diameter at most two. In the decision version of ...
research
12/30/2022

A quasi-quadratic vertex Kernel for Cograph edge editing

We provide a O(k^2 log k) vertex kernel for cograph edge editing. This i...

Please sign up or login with your details

Forgot password? Click here to reset