Faster parameterized algorithm for cluster vertex deletion
type: Item
instance of: scholarly article
title: Faster parameterized algorithm for cluster vertex deletion
author: Dekel Tsur
published in: Theory of Computing Systems
publication date: 2021-06-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1901.07609
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7363125
zbMATH Keywords: graph algorithms
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
OpenAlex ID: W3094363627
cites work: Correlation clustering
cites work: A fast branching algorithm for cluster vertex deletion
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Fixed-parameter algorithms for Vertex Cover \(P_3\)
cites work: Parameterized Algorithms
cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set
cites work: Iterative compression and exact algorithms
cites work: Exact Algorithms via Monotone Local Search
cites work: Automated generation of search tree algorithms for hard graphs modification problems
cites work: Fixed-parameter algorithms for cluster vertex deletion
cites work: A faster FPT algorithm for 3-path vertex cover
cites work: Parameterized algorithm for 3-path vertex cover
cites work: A fixed-parameter algorithm for the vertex cover \(P_3\) problem
cites work: A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
cites work: Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
DOI: 10.1007/S00224-020-10005-W
Recommended article: Fixed-parameter algorithms for cluster vertex deletion
Recommended article: Fixed-Parameter Algorithms for Cluster Vertex Deletion
Recommended article: A fast branching algorithm for cluster vertex deletion
Recommended article: A Fast Branching Algorithm for Cluster Vertex Deletion
Recommended article: An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
Recommended article: A tight approximation algorithm for the cluster vertex deletion problem
Recommended article: Faster parameterized algorithms for two vertex deletion problems
Recommended article: Even faster parameterized cluster deletion and cluster editing
Recommended article: Faster deterministic algorithm for cactus vertex deletion
description: scientific article; zbMATH DE number 7363125