Parameterized Complexity of Generalized Domination Problems

DOI10.1007/978-3-642-11409-0_12zbMath1273.68171OpenAlexW1812095249MaRDI QIDQ5851100

Petr A. Golovach, Ondřej Suchý, Jan Kratochvíl

Publication date: 21 January 2010

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-642-11409-0_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Parameterized complexity of generalized domination problems ⋮ Branch and recharge: exact algorithms for generalized domination

This page was built for publication: Parameterized Complexity of Generalized Domination Problems