Skip to main navigation Skip to search Skip to main content

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

  • Weizmann Institute of Science

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.
Sort by

Keyphrases

Mathematics

Computer Science