"Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned ..."

Takuya Akiba et al. (2015)

> Home

Details and statistics

DOI: 10.1609/AAAI.V29I1.9154

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/AkibaHNIY15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/AkibaHNIY15
Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida:
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. AAAI 2015: 2-8

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.