Scalable Top-K Structural Diversity Search


This paper studies the problem of top-k structural diversity search, which is to compute k users with the highest structural diversities that is measured by the number of connected components in the neighborhood of a user. As the existing algorithms are not scalable for processing large graphs due to their limits, in this paper we propose a scalable… (More)
DOI: 10.1109/ICDE.2017.48


2 Figures and Tables

Slides referencing similar topics