Improved Dynamic Reachability Algorithms for Directed Graphs.
Liam RodittyUri ZwickPublished in: SIAM J. Comput. (2008)
Keyphrases
- directed graph
- orders of magnitude
- recently developed
- data structure
- random walk
- learning algorithm
- directed acyclic graph
- dynamic programming
- theoretical analysis
- computationally efficient
- disjoint paths
- genetic algorithm
- times faster
- dynamic environments
- optimization problems
- worst case
- probability distribution
- computational cost
- objective function
- image segmentation
- social networks