Upper bounds on the k-forcing number of a graph.

David Amos Yair Caro Randy Davila Ryan Pepper

Published in: Discret. Appl. Math. (2015)

Keyphrases

upper bound
small number
computational complexity
lower bound
graph structure
maximum number
data sets
machine learning
scheduling problem
structured data
upper and lower bounds
constant factor
sample size
memory requirements