Exact Algorithms for Edge Deletion to Cactus
Data Structures and Algorithms
2026-03-31 v1 Computational Complexity
Discrete Mathematics
Combinatorics
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.
Keywords
Cite
@article{arxiv.2603.27655,
title = {Exact Algorithms for Edge Deletion to Cactus},
author = {Sheikh Shakil Akhtar and Geevarghese Philip},
journal= {arXiv preprint arXiv:2603.27655},
year = {2026}
}