We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

In this paper we study approximate landmark-based methods for point-to-point distance
estimation in very large networks. These methods involve selecting a subset of nodes as …

Efficient shortest path query answering in large graphs is enjoying a growing number of
applications, such as ranked keyword search in databases, social networks, ontology …

The problem of k-truss search has been well defined and investigated to find the highly
correlated user groups in social networks. But there is no previous study to consider the …

In many applications, information is best represented as graphs. In a dynamic world,
information changes and so the graphs representing the information evolve with time. We …

With more and more social network data being released, protecting the sensitive information
within social networks from leakage has become an important concern of publishers …

We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …

We study the problem of point-to-point distance querying for massive scale-free graphs,
which is important for numerous applications. Given a directed or undirected graph, we …

Measuring proximity in a social network is an important task, with many interesting
applications, including person search and link prediction. Person search is the problem of …

Virtually all network analyses involve structural measures between pairs of vertices, or of the
vertices themselves, and the large amount of symmetry present in real-world complex …