Login / Signup
Bounds on the burning numbers of spiders and path-forests.
Anthony Bonato
Thomas Lidbetter
Published in:
Theor. Comput. Sci. (2019)
Keyphrases
</>
upper bound
lower bound
random forest
upper and lower bounds
worst case
shortest path
machine learning
endpoints
data sets
information retrieval
e learning
search algorithm
special case
error bounds
lower and upper bounds
tight bounds