A Lower Bound on Cycle-Finding in Sparse Digraphs.

Xi Chen Tim Randolph Rocco A. Servedio Timothy Sun

Published in: SODA (2020)

Keyphrases

lower bound
upper bound
branch and bound algorithm
branch and bound
case study
objective function
worst case
lower and upper bounds
database
np hard
data sets
learning algorithm
random walk
sparse representation
sparse data