Nordhaus-Gaddum results for weakly convex domination number of a graph.

Magdalena Lemanska

Published in: Discuss. Math. Graph Theory (2010)

Keyphrases

small number
graph theory
computational complexity
random walk
graph theoretic
database
case study
bayesian networks
optimal solution
special case
knn
convex optimization