A near-linear time algorithm for computing replacement paths in planar directed graphs.

Yuval Emek, David Peleg, Liam Roditty

Browse the full SODA paper archive.