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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 16; s. 79 - 89
Hlavný autor:	Böcker, Sebastian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2012
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!