Login / Signup

Approximation hardness of dominating set problems in bounded degree graphs.

Miroslav ChlebíkJanka Chlebíková
Published in: Inf. Comput. (2008)
Keyphrases
  • dominating set
  • connected dominating set
  • optimization problems
  • graph theoretic
  • decision makers
  • np complete
  • database
  • inductive logic programming