Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time.

Christian Wulff-Nilsen

Published in: SODA (2010)

Keyphrases

directed graph
disjoint paths
random walk
worst case
graph structure
directed acyclic graph
maximum flow
strongly connected
lower bound
undirected graph
computational complexity
evolutionary algorithm
markov chain
shortest path
combinatorial optimization
graph structures