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)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of discrete algorithms (Amsterdam, Netherlands) Jg. 16; S. 79 - 89
1. Verfasser:	Böcker, Sebastian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.10.2012
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!