"Shortest paths in directed planar graphs with negative lengths: A ..."

Philip N. Klein, Shay Mozes, Oren Weimann (2010)

> Home

Details and statistics

DOI: 10.1145/1721837.1721846

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/KleinMW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/KleinMW10
Philip N. Klein, Shay Mozes, Oren Weimann:
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm. ACM Trans. Algorithms 6(2): 30:1-30:18 (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.