Faster parameterized algorithm for Bicluster Editing

•We give an O⁎(2.636k)-time algorithm for Bicluster Editing.•Our algorithm is faster than previous algorithms for this problem.•The algorithm uses branching rules that branch on every minimal editing set of some induced subgraph of the input graph. In the Bicluster Editing problem the input is a bip...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 168; s. 106095
Hlavní autor: Tsur, Dekel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.06.2021
Témata:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0020-0190
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We give an O⁎(2.636k)-time algorithm for Bicluster Editing.•Our algorithm is faster than previous algorithms for this problem.•The algorithm uses branching rules that branch on every minimal editing set of some induced subgraph of the input graph. 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).
ISSN:0020-0190
DOI:10.1016/j.ipl.2021.106095