"A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs."

Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter (1992)

> Home

Details and statistics

DOI: 10.1109/SPDP.1992.242747

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/spdp/SairamTV92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spdp/SairamTV92
Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter:
A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. SPDP 1992: 176-183

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.