Login / Signup
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners.
Jakub Pachocki
Liam Roditty
Aaron Sidford
Roei Tov
Virginia Vassilevska Williams
Published in:
SODA (2018)
Keyphrases
</>
directed graph
theoretical analysis
computationally efficient
neural network
data structure
computational complexity
learning algorithm
graph structures
times faster
random walk
optimization problems
machine learning algorithms
computational cost
dynamic programming
undirected graph
social networks
maximum flow