Fast Vertex Merging for Cluster Editing

FPT algorithms for cluster editing are relatively successful in practice, however there is still the need for a fast weighted graph data-structure that allows merging vertices and deleting edges while keeping track of a lower bound. This paper presents such a data-structure with at worst O(n²) time complexities for basic operations on...