A linear kernel for a planar connected dominating set

DOI10.1016/j.tcs.2010.10.045zbMath1216.68131MaRDI QIDQ534569

Saket Saurabh, Daniel Lokshtanov, Matthias Mnich

Publication date: 18 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.045

zbMATH Keywords

planar graphs; connected dominating set; kernelization; reduce or refine

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C40: Connectivity