A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We introduce a dynamic version of the NP-hard graph 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) that represents a solution for the first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for the second ("subsequent") input graph? This model is motivated by several application scenarios, including incremental clustering,arXiv:1810.06625v2 fatcat:lquysl3qx5djppf5v4674dlr2i