Fixed-parameter enumerability of cluster editing and related problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 2090012 (Why is no real title available?)
- A More Effective Linear Kernelization for Cluster Editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Computing and Combinatorics
- Correlation clustering
- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Graph-modeled data clustering: Exact algorithms for clique generation
- NP-hard problems in hierarchical-tree clustering
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- The Cluster Editing Problem: Implementations and Experiments
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
Cited in
(19)- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Fixed-Parameter Tractable Generalizations of Cluster Editing
- Cluster editing
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A faster algorithm for the cluster editing problem on proper interval graphs
- Alternative parameterizations for cluster editing
- On the complexity of multi-parameterized cluster editing
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Even faster parameterized cluster deletion and cluster editing
- Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
- Graph-based data clustering with overlaps
- Graph-Theoretic Concepts in Computer Science
- Parameterized algorithms for min-max 2-cluster editing
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Graph-Based Data Clustering with Overlaps
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Bounded-degree techniques accelerate some parameterized graph algorithms
- The Cluster Editing Problem: Implementations and Experiments
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
This page was built for publication: Fixed-parameter enumerability of cluster editing and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970105)
