Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs.
Shiri ChechikMoran NechushtanPublished in: ICALP (2020)
Keyphrases
- directed graph
- learning algorithm
- computational efficiency
- computationally efficient
- data sets
- maximum flow
- theoretical analysis
- machine learning
- benchmark datasets
- machine learning algorithms
- random walk
- optimization problems
- significant improvement
- data structure
- directed acyclic graph
- strongly connected
- disjoint paths