Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.

Yosuke Yano|Takuya Akiba|Yoichi Iwata|Yuichi Yoshida


Anthology ID:DBLP:conf/cikm/YanoAIY13
Volume:22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013
Year:2013
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1601-1606
URL:https://doi.org/10.1145/2505515.2505724
DOI:https://doi.org/10.1145/2505515.2505724
DBLP:conf/cikm/YanoAIY13
BibTeX:
@inproceedings{yano-2013-fast, author = {Yosuke Yano and Takuya Akiba and Yoichi Iwata and Yuichi Yoshida}, editor = {Qi He and Arun Iyengar and Wolfgang Nejdl and Jian Pei and Rajeev Rastogi}, title = {{Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths}}, booktitle = {{22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013}}, pages = {1601--1606}, publisher = {ACM}, year = {2013}, url = {https://doi.org/10.1145/2505515.2505724}, doi = {https://doi.org/10.1145/2505515.2505724} }