Complexity of dense bicluster editing problems

DOI10.1007/978-3-319-08783-2_14MaRDI QIDQ2920455zbMATH OpenOpenAlexWikidataFDO

Authors Peng Sun, Jiong Guo, Jan Baumbach

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

bicluster editingdata reductionNP-hardnessparameterized complexity

Mathematics Subject Classification ID

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

Recommendations

• Editing graphs into disjoint unions of dense clusters
• Editing graphs into disjoint unions of dense clusters
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Applying modular decomposition to parameterized cluster editing problems
• Alternative parameterizations for cluster editing

Cited in

(5)

• Even better fixed-parameter algorithms for bicluster editing
• Faster parameterized algorithm for Bicluster Editing
• Editing graphs into disjoint unions of dense clusters
• Editing graphs into disjoint unions of dense clusters
• Improved kernelization and fixed-parameter algorithms for bicluster editing

This page was built for publication: Complexity of dense bicluster editing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920455)