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 application/pdf
.
A golden ratio parameterized algorithm for Cluster Editing
2012
Journal of Discrete Algorithms
The Cluster Editing problem asks to transform a graph by at most k edge modifications into a disjoint union of cliques. The problem is NP-complete, but several parameterized algorithms are known. We present a novel search tree algorithm for the problem, which improves running time from O (1.76 k + m + n) to O (1.62 k + m + n) for m edges and n vertices. In detail, we can show that we can always branch with branching vector (2, 1) or better, resulting in the golden ratio as the base of the
doi:10.1016/j.jda.2012.04.005
fatcat:2iy7cudorfbkpamhzysy6h2nau