Faster deterministic algorithm for Cactus Vertex Deletion

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number106317
JournalInformation Processing Letters
StatePublished - 1 Jan 2023


  • Algorithms
  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Faster deterministic algorithm for Cactus Vertex Deletion'. Together they form a unique fingerprint.

Cite this