Tight bounds for parameterized complexity of cluster editing with a small number of clusters
From MaRDI portal
Publication:2453563
Recommendations
Cites work
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- A more effective linear kernelization for cluster editing
- A more relaxed model for graph-based data clustering: s-plex cluster editing
- Aggregating inconsistent information: ranking and clustering
- Applying modular decomposition to parameterized cluster editing problems
- Bidimensionality: new connections between FPT algorithms and PTASs
- Cluster editing
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- Clustering with partial information
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering with a fixed number of clusters
- Editing graphs into disjoint unions of dense clusters
- Even faster parameterized cluster deletion and cluster editing
- Exact algorithms for cluster editing: Evaluation and experiments
- Exact exponential algorithms.
- Fast FAST
- Fixed-parameter enumerability of cluster editing and related problems
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Graph-based data clustering with overlaps
- Graph-modeled data clustering: Exact algorithms for clique generation
- Lower bounds based on the exponential time hypothesis
- Parametrized complexity theory.
- Quadratic forms on graphs (extended abstract)
- Subexponential parameterized algorithm for minimum fill-in
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Tight bounds for parameterized complexity of Cluster Editing
- What's next? Future directions in parameterized complexity
- Which problems have strongly exponential complexity?
Cited in
(45)- A parameterized complexity view on collapsing \(k\)-cores
- A fast branching algorithm for cluster vertex deletion
- Parameterized complexity of biclique contraction and balanced biclique contraction
- Dominator coloring and CD coloring in almost cluster graphs
- Dominator coloring and CD coloring in almost cluster graphs
- Applying a cut-based data reduction rule for weighted cluster editing in polynomial time
- Paths to trees and cacti
- Parameterized algorithms for min-max 2-cluster editing
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Reducing rank of the adjacency matrix by graph modification
- Parameterized Dynamic Cluster Editing
- Branch-and-price for \(p\)-cluster editing
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
- Rank reduction of oriented graphs by vertex and edge deletions
- Tight bounds for parameterized complexity of Cluster Editing
- On the parameterized complexity of s-club cluster deletion problems
- On the parameterized complexity of \(s\)-club cluster deletion problems
- A new temporal interpretation of cluster editing
- Polyhedral properties of the induced cluster subgraphs
- The Multi-parameterized Cluster Editing Problem
- Paths to trees and cacti
- Cluster editing parameterized above modification-disjoint P₃-packings
- Parameterized low-rank binary matrix approximation
- Parameterized dynamic cluster editing
- The complexity of cluster vertex splitting and company
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- A survey of parameterized algorithms and the complexity of edge modification
- Cluster editing parameterized above modification-disjoint P₃-Packings
- Exploiting dense structures in parameterized complexity
- On width measures and topological problems on semi-complete digraphs
- Graph-Theoretic Concepts in Computer Science
- A PTAS for the Cluster Editing Problem on Planar Graphs
- Cluster editing for multi-layer and temporal graphs
- A new temporal interpretation of cluster editing
- Reducing rank of the adjacency matrix by graph modification
- Subexponential algorithm for d-cluster edge deletion: exception or rule?
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- Branch-and-cut approaches for p-cluster editing
- Exploring the subexponential complexity of completion problems
- Parameterized low-rank binary matrix approximation
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Fast biclustering by dual parameterization
- (Sub)linear kernels for edge modification problems toward structured graph classes
This page was built for publication: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453563)
