DeepAI AI Chat
Log In Sign Up

A New Temporal Interpretation of Cluster Editing

by   Cristiano Bocci, et al.
University of Glasgow
Università di Siena

The NP-complete graph problem Cluster Editing seeks to transform a static graph into disjoint union of cliques by making the fewest possible edits to the edge set. We introduce a natural interpretation of this problem in the setting of temporal graphs, whose edge-sets are subject to discrete changes over time, which we call Editing to Temporal Cliques. This problem is NP-complete even when restricted to temporal graphs whose underlying graph is a path, but we obtain two polynomial-time algorithms for special cases with further restrictions. In the static setting, it is well-known that a graph is a disjoint union of cliques if and only if it contains no induced copy of P_3; we demonstrate that no general characterisation involving sets of at most four vertices can exist in the temporal setting, but obtain a complete characterisation involving forbidden configurations on at most five vertices. This characterisation gives rise to an FPT algorithm parameterised simultaneously by the permitted number of modifications and the lifetime of the temporal graph, which uses a simple search-tree strategy.


page 1

page 2

page 3

page 4


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...

(1,1)-Cluster Editing is Polynomial-time Solvable

A graph H is a clique graph if H is a vertex-disjoin union of cliques. A...

A Parameterized View on Multi-Layer Cluster Editing

In classical Cluster Editing we seek to transform a given graph into a d...

Incompressibility of H-free edge modification problems: Towards a dichotomy

Given a graph G and an integer k, the H-free Edge Editing problem is to ...

Making Life More Confusing for Firefighters

It is well known that fighting a fire is a hard task. The Firefighter pr...

Parameterized Dynamic Cluster Editing

We introduce a dynamic version of the NP-hard Cluster Editing problem. T...

Heuristic Algorithms for Best Match Graph Editing

Best match graphs (BMGs) are a class of colored digraphs that naturally ...