Tight bounds for parameterized complexity of cluster editing with a small number of clusters
From MaRDI portal
Publication:2453563
DOI10.1016/j.jcss.2014.04.015zbMath1311.68076WikidataQ60488409 ScholiaQ60488409MaRDI QIDQ2453563
Marcin Pilipczuk, Fedor V. Fomin, Michał Pilipczuk, Stefan Kratsch, Yngve Villanger
Publication date: 10 June 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.015
cluster editing; parameterized complexity; correlation clustering; subexponential-time algorithms; exponential-time hypothesis
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)