跳到正文
研踪PaperTrail
← 研踪 PaperTrail

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
arXiv ↗PDF ↗

摘要

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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-16 23:16 · 最新观测版本

Exact Algorithms for Edge Deletion to Cactus

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.

查看此版本解读 →查看此版本原文 ↗