Lower bounds on the total domination number of a graph.

Wyatt J. Desormeaux Michael A. Henning

Published in: J. Comb. Optim. (2016)

Keyphrases

lower bound
small number
computational complexity
np hard
memory requirements
special case
upper bound
np complete
random walk
error bounds
directed acyclic graph