On efficiently finding reverse k-nearest neighbors over uncertain graphs
Crossref DOI link: https://doi.org/10.1007/s00778-017-0460-y
Published Online: 2017-03-17
Published Print: 2017-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gao, Yunjun
Miao, Xiaoye
Chen, Gang
Zheng, Baihua
Cai, Deng
Cui, Huiyong
License valid from 2017-03-17