Faster deterministic algorithm for Cactus Vertex Deletion

Abstract

In the Cactus Vertex Deletion (resp., Even Cycle Transversal) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O⁎(13.69k)-time algorithms for Cactus Vertex Deletion and Even Cycle Transversal.