Faster Algorithms for Rooted Connectivity in Directed Graphs.
Chandra ChekuriKent QuanrudPublished in: ICALP (2021)
Keyphrases
- directed graph
- significant improvement
- orders of magnitude
- highly efficient
- recently developed
- computationally efficient
- theoretical analysis
- learning algorithm
- strongly connected
- maximum flow
- random walk
- optimization problems
- computational cost
- benchmark datasets
- computational efficiency
- times faster
- information extraction
- directed acyclic graph
- computational complexity
- neural network