Faster parameterized algorithm for BICLUSTER EDITING

Dekel Tsur

doi:10.1016/j.ipl.2021.106095

Faster parameterized algorithm for BICLUSTER EDITING

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

Abstract

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 k edges. In this paper we give an algorithm for BICLUSTER EDITING whose running time is O^⁎(2.636^k).

Original language	English
Article number	106095
Journal	Information Processing Letters
Volume	168
DOIs	https://doi.org/10.1016/j.ipl.2021.106095
State	Published - 1 Jun 2021

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2021.106095

Cite this

@article{d5896cde2608429c95025ea224478786,

title = "Faster parameterized algorithm for BICLUSTER EDITING",

abstract = "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 k edges. In this paper we give an algorithm for BICLUSTER EDITING whose running time is O⁎(2.636k).",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = jun,

day = "1",

doi = "10.1016/j.ipl.2021.106095",

language = "English",

volume = "168",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster parameterized algorithm for BICLUSTER EDITING

AU - Tsur, Dekel

PY - 2021/6/1

Y1 - 2021/6/1

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 k edges. 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 k edges. In this paper we give an algorithm for BICLUSTER EDITING whose running time is O⁎(2.636k).

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - https://www.scopus.com/pages/publications/85099298899

U2 - 10.1016/j.ipl.2021.106095

DO - 10.1016/j.ipl.2021.106095

M3 - Article

SN - 0020-0190

VL - 168

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106095

ER -

Faster parameterized algorithm for BICLUSTER EDITING

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this