Spanning cactus of a graph: Existence, extension, optimization, and approximation

DOI10.1016/j.dam.2012.08.006zbMath1258.05101OpenAlexW2085596541MaRDI QIDQ1759874

Santosh N. Kabadi, Abraham P. Punnen

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.006

zbMATH Keywords

computational complexityapproximation algorithmscactus extensionedge-costeven spanning treemaximum cactus extension problemminimum spanning cactus problemodd spanning treespanning cactus

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (2)

Spanning cactus: complexity and extensions ⋮ Approximate spanning cactus

This page was built for publication: Spanning cactus of a graph: Existence, extension, optimization, and approximation