Cluster editing with overlapping communities
From MaRDI portal
Cites work
- A more effective linear kernelization for cluster editing
- A simple and improved parameterized algorithm for bicluster editing
- A simplified NP-complete satisfiability problem
- Alternative parameterizations for cluster editing
- An FPT algorithm for bipartite vertex splitting
- Cluster editing with locally bounded modifications
- Cluster editing with vertex splitting
- Fast biclustering by dual parameterization
- Faster parameterized algorithm for Bicluster Editing
- Fixed-parameter algorithms for cluster vertex deletion
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph clustering
- Graph-Based Data Clustering with Overlaps
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Improved Algorithms for Bicluster Editing
- Parameterized algorithms
- Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
- Parametrized complexity theory.
- Planarizing graphs and their drawings by vertex splitting
- Subexponential algorithm for d-cluster edge deletion: exception or rule?
- Which problems have strongly exponential complexity?
Cited in
(3)
This page was built for publication: Cluster editing with overlapping communities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926208)