Complexity of Dense Bicluster Editing Problems

DOI10.1007/978-3-319-08783-2_14zbMath1423.68219OpenAlexW141081312WikidataQ62779970 ScholiaQ62779970MaRDI QIDQ2920455

Jan Baumbach, Jiong Guo, Peng Sun

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_14

zbMATH Keywords

data reductionNP-hardnessparameterized complexitybicluster editing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Even better fixed-parameter algorithms for bicluster editing

This page was built for publication: Complexity of Dense Bicluster Editing Problems