An improved deterministic parameterized algorithm for cactus vertex deletion

DOI10.1007/s00224-022-10076-xzbMath1487.05250arXiv2012.04910MaRDI QIDQ2135634

Yusuke Kobayashi, Tesshu Hanaka, Masashi Kiyomi, Tatsuya Gima, Yota Otachi, Yuuki Aoike, Yasuaki Kobayashi, Kazuhiro Kurita

Publication date: 9 May 2022

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.04910

zbMATH Keywords

fixed-parameter tractable; cactus vertex deletion; even cycle transversal; measure and conquer analysis

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C40: Connectivity

Related Items

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs, Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes, Faster deterministic algorithm for cactus vertex deletion

Cites Work

• Unnamed Item
• Exact exponential algorithms.
• Finding odd cycle transversals.
• Improved upper bounds for vertex cover
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• A faster parameterized algorithm for pseudoforest deletion
• Improved analysis of highest-degree branching for feedback vertex set
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
• Quick but odd growth of cacti
• Hitting Forbidden Minors: Approximation and Kernelization
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion
• Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
• A measure & conquer approach for the analysis of exact algorithms
• Hitting Diamonds and Growing Cacti
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Parameterized Algorithms for Even Cycle Transversal
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
• Improved FPT Algorithms for Deletion to Forest-Like Structures.