Work

Exact Algorithms for Edge Deletion to Cactus

Year: 2026

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2603.27655

Authors: Akhtar, Sheikh Shakil, Philip, Geevarghese

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7147362962

Cites:

Cited by:

Related to: