Cluster editing with locally bounded modifications
نویسندگان
چکیده
منابع مشابه
Cluster Editing with Locally Bounded Modifications Revisited
For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012), at cost of a marginally worse kernel size bound. We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.
متن کاملCluster editing with locally bounded modifications
Given an undirected graph G = (V,E) and a nonnegative integer k, the NPhard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. In this work, we study how “local degree bounds” influence the complexity of Cluster Editing and of the related Cluster Deletion problem which allows only edge deletions. We show that even for graphs ...
متن کاملFamilies of sets with locally bounded width
A family of sets F is locally k-wide if and only if the width (as a poset ordered by inclusion) of F x = fU 2 F j x 2 U g is at most k for every x. The directed covering graph of a locally 1-wide family of sets is a forest of rooted trees. It is shown that if F is a locally k-wide family of subsets of f1; : : : ; ng, then jFj (2k) k?1 n. The proof involves a counting argument based on families ...
متن کاملLocally polynomially bounded structures
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally definable in a fixed o-minimal and polynomially bounded reduct. As an application we show that in certain o-minimal structures definable functions are piecewise im...
متن کاملNext generation cluster editing
This work aims at improving the quality of structural variant prediction from the mapped reads of a sequenced genome. We suggest a new model based on cluster editing in weighted graphs and introduce a new heuristic algorithm that allows to solve this problem quickly and with a good approximation on the huge graphs that arise from biological datasets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.05.019