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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 168; S. 106095
1. Verfasser: Tsur, Dekel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.06.2021
Schlagworte:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0020-0190
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•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