Improved kernelization and fixed-parameter algorithms for bicluster editing
From MaRDI portal
Recommendations
- A simple and improved parameterized algorithm for bicluster editing
- Faster parameterized algorithm for Bicluster Editing
- Improved Algorithms for Bicluster Editing
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Applying modular decomposition to parameterized cluster editing problems
Cites work
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- Complexity of dense bicluster editing problems
- Correlation clustering
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Even better fixed-parameter algorithms for bicluster editing
- Exact exponential algorithms.
- Fast biclustering by dual parameterization
- Faster parameterized algorithm for Bicluster Editing
- Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
- scientific article; zbMATH DE number 2011849 (Why is no real title available?)
- Hybrid metaheuristic for bicluster editing problem
- Improved Algorithms for Bicluster Editing
- Improved approximation algorithms for bipartite correlation clustering
- New heuristics for the bicluster editing problem
- On Editing Graphs into 2-Club Clusters
- On solving manufacturing cell formation via bicluster editing
- On the tractability of covering a graph with 2-clubs
Cited in
(2)
This page was built for publication: Improved kernelization and fixed-parameter algorithms for bicluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645187)
