Improved kernelization and fixed-parameter algorithms for bicluster editing

Given a bipartite graph G , the Bicluster Editing problem asks for the minimum number of edges to insert or delete in G so that every connected component is a bicluster, i.e. a complete bipartite graph. This has several applications, including in bioinformatics and social network analysis. In this w...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 47; no. 5; p. 90
Main Author: Lafond, Manuel
Format: Journal Article
Language:English
Published: New York Springer US 01.07.2024
Springer Nature B.V
Subjects:
Algorithms
Apexes
Approximation
Bioinformatics
Codes
Combinatorics
Convex and Discrete Geometry
Editing
Graph theory
Graphs
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Network analysis
Operations Research/Decision Theory
Optimization
Parameter modification
Social networks
Theory of Computation
Twins
Biclustering
Graph algorithms
Parameterized complexity
Kernelization
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a bipartite graph G , the Bicluster Editing problem asks for the minimum number of edges to insert or delete in G so that every connected component is a bicluster, i.e. a complete bipartite graph. This has several applications, including in bioinformatics and social network analysis. In this work, we study the parameterized complexity under the natural parameter k , which is the number of allowed modified edges. We first show that one can obtain a kernel with 4.5 k vertices, an improvement over the previously known quadratic kernel. We then propose an algorithm that runs in time O ∗ ( 2 . 581 k ) . Our algorithm has the advantage of being conceptually simple and should be easy to implement.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-024-01186-y