Applying Modular Decomposition to Parameterized Bicluster Editing
From MaRDI portal
Publication:3499719
DOI10.1007/11847250_1zbMath1154.68455OpenAlexW1510857214MaRDI QIDQ3499719
Maise Dantas da Silva, Fábio Protti, Jayme Luiz 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
NP-complete problemsfixed-parameter tractabilitycluster graphsedge modification problemsbicluster graphs
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On solving manufacturing cell formation via bicluster editing, Faster parameterized algorithm for \textsc{Bicluster Editing}, Improved Algorithms for Bicluster Editing, Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}, Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs, Clustering with partial information, Even better fixed-parameter algorithms for bicluster editing, Applying modular decomposition to parameterized cluster editing problems, Clustering with Partial Information, Fixed-Parameter Algorithms for Cluster Vertex Deletion, A more effective linear kernelization for cluster editing, Hybrid Metaheuristic for Bicluster Editing Problem
