An upper bound for the number of independent sets in regular graphs.

David J. Galvin

Published in: Discret. Math. (2009)

Keyphrases

upper bound
lower bound
small number
disjoint sets
machine learning
case study
objective function
pattern recognition
computational complexity
worst case
constant factor
closed sets
error probability