"When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries ..."

Dian Ouyang et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3183713.3196913

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sigmod/OuyangQCLZZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/OuyangQCLZZ18
Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu:
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference 2018: 709-724

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.