Faster parameterized algorithm for cluster vertex deletion

Recommendations

Fixed-parameter algorithms for cluster vertex deletion
Fixed-Parameter Algorithms for Cluster Vertex Deletion
A fast branching algorithm for cluster vertex deletion
A fast branching algorithm for cluster vertex deletion
An improved parameterized algorithm for the p-cluster vertex deletion problem
A tight approximation algorithm for the cluster vertex deletion problem
A tight approximation algorithm for the cluster vertex deletion problem
Faster parameterized algorithms for two vertex deletion problems
Even faster parameterized cluster deletion and cluster editing
Faster deterministic algorithm for cactus vertex deletion

Cites work

A fast branching algorithm for cluster vertex deletion
A faster FPT algorithm for 3-path vertex cover
A fixed-parameter algorithm for the vertex cover P₃ problem
A measure and conquer approach for the parameterized bounded degree-one vertex deletion
A top-down approach to search-trees: Improved algorithmics for 3-hitting set
Automated generation of search tree algorithms for hard graphs modification problems
Correlation clustering
Fixed-parameter algorithms for cluster vertex deletion
Fixed-parameter algorithms for Vertex Cover \(P_3\)
Fixed-parameter tractability of graph modification problems for hereditary properties
Iterative compression and exact algorithms
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Parameterized algorithm for 3-path vertex cover
Parameterized algorithms

Cited in

(46)

Faster deterministic algorithm for cactus vertex deletion
An improved deterministic parameterized algorithm for cactus vertex deletion
Faster FPT algorithms for deletion to pairs of graph classes
Subexponential algorithm for d-cluster edge deletion: exception or rule?
Cluster deletion revisited
Faster parameterized algorithm for pumpkin vertex deletion set
A fast branching algorithm for cluster vertex deletion
On the d-claw vertex deletion problem
Faster parameterized algorithms for two vertex deletion problems
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
An FPT certifying algorithm for the vertex-deletion problem
Cluster vertex deletion: a parameterization between vertex cover and clique-width
Fast dynamic graph algorithms for parameterized problems
Bounded-degree techniques accelerate some parameterized graph algorithms
A fast branching algorithm for cluster vertex deletion
On 2-clubs in graph-based data clustering: theory and algorithm engineering
An improved parameterized algorithm for the p-cluster vertex deletion problem
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
Streaming deletion problems Parameterized by vertex cover
On conflict-free spanning tree: algorithms and complexity
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
On the parameterized complexity of s-club cluster deletion problems
On the \(d\)-claw vertex deletion problem
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
Cluster vertex deletion problems on cubic graphs
Parameterized algorithms for editing to uniform cluster graph
When can cluster deletion with bounded weights be solved efficiently?
Improved parameterized algorithms for cluster vertex deletion
Smaller kernels for 3-leaf power modifications problems
Graph clustering problems under the Lens of parameterized local search
Bandwidth parameterized by cluster vertex deletion number
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Graph clustering problems under the Lens of parameterized local search
Breaking a graph into connected components with small dominating sets
When can cluster deletion with bounded weights be solved efficiently?
Elimination distance to dominated clusters
Parameterized maximum node-disjoint paths
Parameterized algorithms for editing to uniform cluster graph
Fixed-parameter algorithms for cluster vertex deletion

This page was built for publication: Faster parameterized algorithm for cluster vertex deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035480)