Even better fixed-parameter algorithms for bicluster editing
From MaRDI portal
Publication:2019506
DOI10.1007/978-3-030-58150-3_47OpenAlexW3082166776MaRDI QIDQ2019506
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_47
Related Items (2)
Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}
Cites Work
- Unnamed Item
- On solving manufacturing cell formation via bicluster editing
- Correlation clustering
- Cluster editing with locally bounded modifications
- New heuristics for the bicluster editing problem
- Automated generation of search tree algorithms for hard graphs modification problems
- A golden ratio parameterized algorithm for cluster editing
- On structural parameterizations for the 2-club problem
- Hybrid Metaheuristic for Bicluster Editing Problem
- On Editing Graphs into 2-Club Clusters
- Complexity of Dense Bicluster Editing Problems
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Improved Algorithms for Bicluster Editing
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- Fast biclustering by dual parameterization
- On the tractability of covering a graph with 2-clubs
This page was built for publication: Even better fixed-parameter algorithms for bicluster editing
