Login / Signup
Finding any given 2-factor in sparse pseudorandom graphs efficiently.
Jie Han
Yoshiharu Kohayakawa
Patrick Morris
Yury Person
Published in:
J. Graph Theory (2021)
Keyphrases
</>
pseudorandom
random number
uniformly distributed
high dimensional
reachability queries
graph theory
secret key
sparse representation
graph matching
random numbers
graph mining
directed acyclic
spanning tree
data sets
graph structure
smart card
feature selection