Browsing Faculty of Mathematics and Natural Sciences by Subject "tight bounds"
Now showing items 1-1 of 1
-
Tight bounds for parameterized complexity of Cluster Editing
(Peer reviewed; Journal article, 2013)In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint ...