Faster deterministic algorithm for cactus vertex deletion
type: Item
instance of: scholarly article
title: Faster deterministic algorithm for cactus vertex deletion
author: Dekel Tsur
published in: Information Processing Letters
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7609056
zbMATH Keywords: algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: parameterized complexity
zbMATH Keywords: branching algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2022.106317
OpenAlex ID: W4294927212
Wikidata QID: Q114167060
cites work: An improved deterministic parameterized algorithm for cactus vertex deletion
cites work: A faster parameterized algorithm for pseudoforest deletion
cites work: Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
cites work: Parameterized Algorithms
cites work: Improved FPT Algorithms for Deletion to Forest-Like Structures.
cites work: Quick but odd growth of cacti
cites work: Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
cites work: An improved FPT algorithm for almost forest deletion problem
cites work: Parameterized Algorithms for Even Cycle Transversal
cites work: Bivariate complexity analysis of \textsc{Almost Forest Deletion}
DOI: 10.1016/J.IPL.2022.106317
description: scientific article; zbMATH DE number 7609056