An improved deterministic parameterized algorithm for cactus vertex deletion
From MaRDI portal
Publication:2135634
DOI10.1007/s00224-022-10076-xzbMath1487.05250arXiv2012.04910MaRDI QIDQ2135634
Yusuke Kobayashi, Yasuaki Kobayashi, Masashi Kiyomi, Yota Otachi, Tesshu Hanaka, Kazuhiro Kurita, Yuuki Aoike, Tatsuya Gima
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
fixed-parameter tractable; cactus vertex deletion; even cycle transversal; measure and conquer analysis
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C40: Connectivity