Fixed-parameter enumerability of cluster editing and related problems
From MaRDI portal
Publication:970105
DOI10.1007/S00224-008-9130-1zbMATH Open1209.68360OpenAlexW2019003450MaRDI QIDQ970105FDOQ970105
Publication date: 10 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9130-1
Recommendations
Cites Work
- Title not available (Why is that?)
- Automated generation of search tree algorithms for hard graphs modification problems
- Correlation clustering
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
- Cluster graph modification problems
- A More Effective Linear Kernelization for Cluster Editing
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- NP-hard problems in hierarchical-tree clustering
- The Cluster Editing Problem: Implementations and Experiments
- Title not available (Why is that?)
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Graph-modeled data clustering: Exact algorithms for clique generation
- Title not available (Why is that?)
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Computing and Combinatorics
- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
Cited In (18)
- Cluster Editing
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- Graph-Based Data Clustering with Overlaps
- On the complexity of multi-parameterized cluster editing
- Graph-based data clustering with overlaps
- Parameterized algorithms for min-max 2-cluster editing
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Even faster parameterized cluster deletion and cluster editing
- Graph-Theoretic Concepts in Computer Science
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- 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
- The Cluster Editing Problem: Implementations and Experiments
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Cluster editing problem for points on the real line: a polynomial time algorithm
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)
