"Efficient top-k shortest path query processing in sparse graph databases."

Hasan M. Jamil (2017)

> Home

Details and statistics

DOI: 10.1145/3102254.3102264

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wims/Jamil17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wims/Jamil17
Hasan M. Jamil:
Efficient top-k shortest path query processing in sparse graph databases. WIMS 2017: 9:1-9:10

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.