Qiankun Zhu, Hong Cheng, Xin Huang. I/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDB J., 26(4):563-583, 2017. [doi]
@article{ZhuCH17-0,
title = {I/O-efficient algorithms for top-k nearest keyword search in massive graphs},
author = {Qiankun Zhu and Hong Cheng and Xin Huang},
year = {2017},
doi = {10.1007/s00778-017-0464-7},
url = {https://doi.org/10.1007/s00778-017-0464-7},
researchr = {https://researchr.org/publication/ZhuCH17-0},
cites = {0},
citedby = {0},
journal = {VLDB J.},
volume = {26},
number = {4},
pages = {563-583},
}