Parameterized Complexity for Domination Problems on Degenerate Graphs

DOI10.1007/978-3-540-92248-3_18zbMath1202.68278MaRDI QIDQ5302055

Petr A. Golovach, Yngve Villanger

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_18

zbMATH Keywords

algorithms; degenerate graphs; domination; parameterized complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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