An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka +5

A cactus is a connected graph that does not contain $K_4-e$ as a minor. Given a graph $G=(V,E)$ and integer $k\ge 0$, Cactus Vertex Deletion (also known as Diamond Hitting Se…