A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time.
Liam RodittyUri ZwickPublished in: SIAM J. Comput. (2016)
Keyphrases
- np hard
- learning algorithm
- computational complexity
- experimental evaluation
- times faster
- directed graph
- linear complexity
- computational cost
- cost function
- segmentation algorithm
- objective function
- maximum flow
- shortest path problem
- linear systems
- convex hull
- convergence rate
- recognition algorithm
- directed acyclic graph
- optimization algorithm
- special case
- preprocessing
- optimal solution