Exact algorithms for edge deletion to Cactus

DOI10.1007/978-3-032-27732-9_3MaRDI QIDQ7363367zbMATH OpenFDO

Authors Sheikh Shakil Akhtar, Geevarghese Philip

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_3

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• An algorithm for the enumeration of spanning trees
• An improved deterministic parameterized algorithm for cactus vertex deletion
• Decomposition by clique separators
• Edge and vertex intersection of paths in a tree
• Edge deletion to tree-like graph classes
• Faster deterministic algorithm for cactus vertex deletion
• Graph structure and monadic second-order logic. A language-theoretic approach
• Memory efficient algorithms for cactus graphs and block graphs
• On the Number of Husimi Trees
• Parameterized algorithms for even cycle transversal
• Parameterized vertex deletion problems for hereditary graph classes with a block property
• The complexity of some edge deletion problems
• The edge intersection graphs of paths in a tree

This page was built for publication: Exact algorithms for edge deletion to Cactus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363367)