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

Yuval Emek, David Peleg, Liam Roditty (2010)

> Home

Details and statistics

DOI: 10.1145/1824777.1824784

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/EmekPR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/EmekPR10
Yuval Emek, David Peleg, Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6(4): 64:1-64:13 (2010)

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.