A fast branching algorithm for cluster vertex deletion
From MaRDI portal
(Redirected from Publication:255285)
Recommendations
- A fast branching algorithm for cluster vertex deletion
- Faster parameterized algorithm for cluster vertex deletion
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Fixed-parameter algorithms for cluster vertex deletion
- Graph-modeled data clustering: Exact algorithms for clique generation
Cites work
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- A kernelization algorithm for \(d\)-hitting set
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- Aggregating inconsistent information: ranking and clustering
- Applying modular decomposition to parameterized cluster editing problems
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster editing
- Cluster editing with locally bounded modifications
- Clustering with qualitative information
- Correlation clustering
- Exact exponential algorithms.
- Finding odd cycle transversals.
- Fixed-parameter algorithms for cluster vertex deletion
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Kernels: Annotated, Proper and Induced
- Linear time algorithms for graph search and connectivity determination on complement graphs.
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Cited in
(46)- Minimum eccentricity shortest path problem with respect to structural parameters
- Minimum eccentricity shortest path problem with respect to structural parameters
- Parameterized algorithms for the happy set problem
- Structural parameterizations of budgeted graph coloring
- Structural parameterizations of budgeted graph coloring
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Computing densest \(k\)-subgraph with structural parameters
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Fixed-parameter algorithms for cluster vertex deletion
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- s-club cluster vertex deletion on interval and well-partitioned chordal graphs
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Enumeration of maximal irredundant sets for claw-free graphs
- FPT and kernelization algorithms for the induced tree problem
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Parameterized complexity of dominating set variants in almost cluster and split graphs
- Bounded-degree techniques accelerate some parameterized graph algorithms
- Revisiting connected vertex cover: FPT algorithms and lossy kernels
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- Polyhedral properties of the induced cluster subgraphs
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Faster parameterized algorithm for cluster vertex deletion
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Tractability of packing vertex-disjoint a-paths under length constraints
- Cluster vertex deletion problems on cubic graphs
- Parameterized algorithms for editing to uniform cluster graph
- Faster parameterized algorithms for two vertex deletion problems
- Improved parameterized algorithms for cluster vertex deletion
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
- A polynomial kernel for deletion to the scattered class of cliques and trees
- (Independent) Roman domination parameterized by distance to cluster
- Smaller kernels for 3-leaf power modifications problems
- A fast branching algorithm for cluster vertex deletion
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- On the \(d\)-claw vertex deletion problem
- Perfectly matched sets in graphs: parameterized and exact computation
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Bandwidth parameterized by cluster vertex deletion number
- Resolving conflicts for lower-bounded clustering
- On independent cliques and linear complementarity problems
This page was built for publication: A fast branching algorithm for cluster vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255285)
