z-logo
open-access-imgOpen Access
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
Author(s) -
Takuya Akiba,
Takanori Hayashi,
Nozomi Nori,
Y. Iwata,
Yuichi Yoshida
Publication year - 2015
Publication title -
proceedings of the ... aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v29i1.9154
Subject(s) - search engine indexing , landmark , computer science , scalability , robustness (evolution) , shortest path problem , path (computing) , theoretical computer science , data mining , information retrieval , artificial intelligence , graph , database , computer network , biochemistry , chemistry , gene

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here