An FPT algorithm for contraction to cactus

DOI10.1007/978-3-319-94776-1_29MaRDI QIDQ1790990zbMATH OpenOpenAlexFDO

Authors R. Krithika, Pranabendu Misra, Prafullkumar Tale

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

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

Recommendations

• On the parameterized complexity of contraction to generalization of trees
• On the parameterized complexity of contraction to generalization of trees
• Paths to trees and cacti
• On the parameterized complexity of grid contraction

Cited in

(7)

• Reducing the vertex cover number via edge contractions
• On the parameterized complexity of contraction to generalization of trees
• On the parameterized complexity of maximum degree contraction problem
• On the Parameterized Complexity of Maximum Degree Contraction Problem.
• On the parameterized complexity of grid contraction
• A single exponential-time FPT algorithm for cactus contraction
• On the parameterized complexity of contraction to generalization of trees

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

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