Paperlane

no. 16 · Tuesday 17 November 2026

Exact Algorithms for Edge Deletion to Cactus

Sheikh Shakil Akhtar and Geevarghese Philip

math.CO · v2

Abstract

We study two related problems on simple, un-directed graphs: Edge Deletion to Cactus and Spanning Tree to Cactus. Edge Deletion to Cactus has been known to be NP-hard on general graphs at least since 1988. We show improved exact algorithms for the former and a polynomial time algorithm for the latter.

fields
Combinatorics
pdf ↗ page arXiv:2603.27655 ↗