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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization Jg. 47; H. 5; S. 90
1. Verfasser: Lafond, Manuel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.07.2024
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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