An FPT algorithm for contraction to cactus

DOI10.1007/978-3-319-94776-1_29OpenAlexW2811480008MaRDI QIDQ1790990

R. Krithika, Prafullkumar Tale, Pranabendu Misra

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_29

zbMATH Keywords

FPT algorithm\(\mathcal{F}\)-contraction problemcactus contraction

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

On the parameterized complexity of maximum degree contraction problem ⋮ On the parameterized complexity of grid contraction ⋮ Reducing the vertex cover number via edge contractions ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem.

This page was built for publication: An FPT algorithm for contraction to cactus