Improved Algorithms for Bicluster Editing

DOI10.1007/978-3-540-79228-4_39zbMath1139.68420MaRDI QIDQ3502668

Yong Zhang, Jiong Guo, Christian Komusiewicz, Falk Hüffner

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_39

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68W25: Approximation algorithms

68W20: Randomized algorithms

Related Items

On solving manufacturing cell formation via bicluster editing, A survey of the algorithmic aspects of modular decomposition, Complexity and parameterized algorithms for cograph editing, New heuristics for the bicluster editing problem, Even better fixed-parameter algorithms for bicluster editing, The biclique partitioning polytope, A simple and improved parameterized algorithm for bicluster editing, Complexity of modification problems for reciprocal best match graphs, An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs, Faster parameterized algorithm for \textsc{Bicluster Editing}, Hybrid Metaheuristic for Bicluster Editing Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Graph-modeled data clustering: Exact algorithms for clique generation
• NP-hard problems in hierarchical-tree clustering
• Cluster graph modification problems
• Parametrized complexity theory.
• Applying Modular Decomposition to Parameterized Bicluster Editing
• The Cluster Editing Problem: Implementations and Experiments
• A More Effective Linear Kernelization for Cluster Editing
• Efficient Parameterized Preprocessing for Cluster Editing
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Aggregating inconsistent information