Login / Signup

On graphs for which the connected domination number is at most the total domination number.

Oliver Schaudt
Published in: Discret. Appl. Math. (2012)
Keyphrases
  • small number
  • data sets
  • case study
  • hidden markov models
  • finite number
  • random graphs
  • neural network
  • real world
  • data mining
  • learning algorithm
  • objective function
  • search algorithm
  • fixed number