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

Yuval Emek, David Peleg, Liam Roditty (2008)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/EmekPR08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/EmekPR08
Yuval Emek, David Peleg, Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.