arXiv:2603.27655 · v2
Exact Algorithms for Edge Deletion to Cactus
首次提交 2026-03-29 20:14
版本更新 2026-11-16 23:16
雷达观测 2026-11-17 16:10
摘要
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.