"I/O-Efficient Path Traversal in Succinct Planar Graphs."

Craig Dillabaugh et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-015-0086-7

access: closed

type: Journal Article

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DillabaughHMZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DillabaughHMZ17
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77(3): 714-755 (2017)

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.