Efficient Top-K Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

Cite

Text

Akiba et al. "Efficient Top-K Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9154

Markdown

[Akiba et al. "Efficient Top-K Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/akiba2015aaai-efficient/) doi:10.1609/AAAI.V29I1.9154

BibTeX

@inproceedings{akiba2015aaai-efficient,
  title     = {{Efficient Top-K Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling}},
  author    = {Akiba, Takuya and Hayashi, Takanori and Nori, Nozomi and Iwata, Yoichi and Yoshida, Yuichi},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {2-8},
  doi       = {10.1609/AAAI.V29I1.9154},
  url       = {https://mlanthology.org/aaai/2015/akiba2015aaai-efficient/}
}