Tight bounds for parameterized complexity of Cluster Editing

DOI10.4230/LIPIcs.STACS.2013.32zbMath1354.68119OpenAlexW1578435560MaRDI QIDQ2957869

Fedor V. Fomin, Michał Pilipczuk, Yngve Villanger, Marcin Pilipczuk, Stefan Kratsch

Publication date: 30 January 2017

Full work available at URL: http://bora.uib.no/bitstream/1956/12041/2/8.pdf

zbMATH Keywords

cluster editingparameterized complexitycorrelation clusteringsubexponential algorithmstight bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Parameterizing edge modification problems above lower bounds ⋮ Cluster Editing ⋮ Sufficient conditions for edit-optimal clusters ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions ⋮ Parameterized algorithms for module map problems ⋮ Faster parameterized algorithms for deletion to split graphs

This page was built for publication: Tight bounds for parameterized complexity of Cluster Editing