Reverse nearest neighbors in large graphs Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, and Yufei Tao   View Paper (PDF)   Return to Research Session 5: Querying Ordered Data Abstract A reverse nearest neighbor query returns the data objects that have a query point as their nearest neighbor. Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we propose algorithms and optimization techniques for RNN queries by utilizing some characteristics of networks. ©2006 Association for Computing Machinery