TY - JOUR
T1 - Faster parameterized algorithm for Bicluter Editing.
AU - Tsur, Dekel
N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2019
Y1 - 2019
N2 - In the Bicluster Editing problem the input is a bipartite graph G and an integer k, and the goal is to decide whether G can be transformed into a bicluster graph by adding and removing at most kedges. In this paper we give an algorithm for Bicluster Editing whose running time is O∗(2.636k)
AB - In the Bicluster Editing problem the input is a bipartite graph G and an integer k, and the goal is to decide whether G can be transformed into a bicluster graph by adding and removing at most kedges. In this paper we give an algorithm for Bicluster Editing whose running time is O∗(2.636k)
U2 - https://doi.org/10.1016/j.ipl.2021.106095
DO - https://doi.org/10.1016/j.ipl.2021.106095
M3 - מאמר
SN - 0020-0190
VL - 168
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106095
ER -