A near-linear-time algorithm for computing replacement paths in planar directed graphs.
Yuval EmekDavid PelegLiam RodittyPublished in: ACM Trans. Algorithms (2010)
Keyphrases
- experimental evaluation
- directed graph
- high accuracy
- worst case
- computational cost
- optimal solution
- preprocessing
- k means
- detection algorithm
- expectation maximization
- maximum flow
- dynamic programming
- optimization algorithm
- simulated annealing
- computational complexity
- recognition algorithm
- undirected graph
- genetic algorithm
- simple polygon
- cost function
- significant improvement
- objective function
- learning algorithm
- social network analysis
- convergence rate
- search space
- social networks
- disjoint paths