Login / Signup

A strengthened analysis of an algorithm for Dominating Set in planar graphs.

Torben Hagerup
Published in: Discret. Appl. Math. (2012)
Keyphrases
  • dominating set
  • optimal solution
  • dynamic programming
  • computational complexity
  • np hard
  • planar graphs
  • probabilistic model
  • expectation maximization
  • mathematical model
  • parameter estimation
  • lower and upper bounds