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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 47; číslo 5; s. 90
Hlavný autor:	Lafond, Manuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!