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

Yuval Emek, David Peleg, Liam Roditty

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Fingerprint

Dive into the research topics of 'A near-linear time algorithm for computing replacement paths in planar directed graphs'. Together they form a unique fingerprint.

Mathematics

Keyphrases

Computer Science