Blar i Department of Informatics på emneord "subexponential algorithms"
Viser treff 1-2 av 2
-
Fast biclustering by dual parameterization
(Peer reviewed; Journal article, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ... -
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 ...