Applying Modular Decomposition to Parameterized Bicluster Editing

DOI10.1007/11847250_1MaRDI QIDQ3499719zbMATH OpenOpenAlexFDO

Authors Fábio Protti, Maise Dantas da Silva, Jayme L. Szwarcfiter

Publication date 3 June 2008

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11847250_1

zbMATH Keywords

bicluster graphscluster graphsedge modification problemsfixed-parameter tractabilityNP-complete problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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

• Applying modular decomposition to parameterized cluster editing problems
• Faster parameterized algorithm for Bicluster Editing
• Improved Algorithms for Bicluster Editing
• Alternative parameterizations for cluster editing
• scientific article; zbMATH DE number 2011849

Cited in

(17)

• A more effective linear kernelization for cluster editing
• Even better fixed-parameter algorithms for bicluster editing
• A simple and improved parameterized algorithm for bicluster editing
• Clustering with partial information
• Applying modular decomposition to parameterized cluster editing problems
• Faster parameterized algorithm for Bicluster Editing
• Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
• Hybrid metaheuristic for bicluster editing problem
• Complexity of dense bicluster editing problems
• On solving manufacturing cell formation via bicluster editing
• Improved Algorithms for Bicluster Editing
• Clustering with Partial Information
• Fast biclustering by dual parameterization
• Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Parameterized algorithms for module map problems
• Improved kernelization and fixed-parameter algorithms for bicluster editing

This page was built for publication: Applying Modular Decomposition to Parameterized Bicluster Editing

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