A simple and improved parameterized algorithm for bicluster editing
From MaRDI portal
Publication:2059879
DOI10.1016/j.ipl.2021.106193OpenAlexW3198151574MaRDI QIDQ2059879
Publication date: 14 December 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106193
Cites Work
- A \(2k\) kernel for the cluster editing problem
- Exact exponential algorithms.
- Correlation clustering
- Graph-modeled data clustering: Exact algorithms for clique generation
- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- NP-hard problems in hierarchical-tree clustering
- Automated generation of search tree algorithms for hard graphs modification problems
- Clustering with qualitative information
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Improved Algorithms for Bicluster Editing
- Correlation clustering with a fixed number of clusters
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- Fast biclustering by dual parameterization
- Efficient Parameterized Preprocessing for Cluster Editing
- Aggregating inconsistent information
- Unnamed Item
This page was built for publication: A simple and improved parameterized algorithm for bicluster editing