The kernelization complexity of connected domination in graphs with (no) small cycles

DOI10.1007/s00453-012-9681-zzbMath1318.68096MaRDI QIDQ476436

Saket Saurabh, Venkatesh Raman, Geevarghese Philip, Neeldhara Misra

Publication date: 2 December 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9681-z

zbMATH Keywords

girth; connected dominating set; fixed-parameter tractability; kernelization; kernel lower bounds

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C12: Distance in graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)