Parameterized Dynamic Cluster Editing
Algorithmica, pp. 1-44, 2021.
We introduce a dynamic version of the NP-hard graph modification problem Cluster Editing. The essential point here is to take into account dynamically evolving input graphs: having a cluster graph (that is, a disjoint union of cliques) constituting a solution for a first input graph, can we cost-efficiently transform it into a “similar” c...More
Full Text (Upload PDF)
PPT (Upload PPT)