FPT Algorithms for Connected Feedback Vertex Set

DOI10.1007/978-3-642-11440-3_25zbMath1274.68674arXiv0909.3180OpenAlexW2163789465MaRDI QIDQ3404454

Geevarghese Philip, Venkatesh Raman, Neeldhara Misra, Saket Saurabh, Somnath Sikdar

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.3180

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Connecting face hitting sets in planar graphs, Unnamed Item, FPT algorithms for domination in sparse graphs and beyond, Kernelization hardness of connectivity problems in \(d\)-degenerate graphs, Unnamed Item, Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs, Lossy Kernels for Connected Dominating Set on Sparse Graphs, Lossy Kernels for Connected Dominating Set on Sparse Graphs