Dekel Tsur
Senior Academic
Faster parameterized algorithm for BICLUSTER EDITING
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).
| Publication language | English |
| Journal | Information Processing Letters |
| Volume | 168 |
| Publication status | Published - 01.06.2021 |
| Article Number | 106095 |
Keywords
Branching algorithms
Graph algorithms
Parameterized complexity
ASJC Scopus subject areas
Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications
