Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners.
Jakub PachockiLiam RodittyAaron SidfordRoei TovVirginia Vassilevska WilliamsPublished in: CoRR (2016)
Keyphrases
- directed graph
- maximum flow
- random walk
- strongly connected
- computationally efficient
- learning algorithm
- times faster
- significant improvement
- computational cost
- machine learning algorithms
- data mining algorithms
- computational efficiency
- theoretical analysis
- exact computation
- convergence rate
- optimization problems
- special case
- computational complexity
- data structure