Applying Modular Decomposition to Parameterized Bicluster Editing
From MaRDI portal
Recommendations
Cited in
(16)- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Hybrid metaheuristic for bicluster editing problem
- A more effective linear kernelization for cluster editing
- Improved Algorithms for Bicluster Editing
- Complexity of dense bicluster editing problems
- Faster parameterized algorithm for Bicluster Editing
- Even better fixed-parameter algorithms for bicluster editing
- Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
- Applying modular decomposition to parameterized cluster editing problems
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- On solving manufacturing cell formation via bicluster editing
- Clustering with partial information
- Improved kernelization and fixed-parameter algorithms for bicluster editing
- Clustering with Partial Information
- Parameterized algorithms for module map problems
- Fast biclustering by dual parameterization
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)