A golden ratio parameterized algorithm for Cluster Editing

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.76k+m+n)...

Full description

Bibliographic Details

Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 16; pp. 79 - 89
Main Author:	Böcker, Sebastian
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2012
Subjects:	Cluster editing Computational complexity FPT Parameterized algorithm Search tree algorithm Search tree algorithm Parameterized algorithm FPT Cluster editing Computational complexity
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!