With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Recently, the topic of community search (CS) has gained plenty of attention. Given a query
vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on …

Over the past decade, distributed dataflow systems (DDS) have become a standard
technology. In these systems, users write programs in restricted dataflow programming …

Communities are prevalent in social networks, knowledge graphs, and biological networks.
Recently, the topic of community search (CS), extracting a dense subgraph containing a …

With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

Personalized PageRank (PPR) is a widely used node proximity measure in graph mining
and network analysis. Given a source node s and a target node t, the PPR value π (s, t) …

The purpose of this paper is to examine the problem of label-constrained reachability (LCR)
and K-reach (LCKR) queries, which are fundamental in a wide variety of applications using …

Given a graph, how can we quantify similarity between two nodes in an effective and
scalable way? SimRank is an attractive measure of pairwise similarity based on graph …

Given a graph G and a query vertex q, the topic of community search (CS), aiming to retrieve
a dense subgraph of G containing q, has gained much attention. Most existing works focus …

SimRank is a classic measure of the similarities of nodes in a graph. Given a node u in
graph G=(V,E), a\em single-source SimRank query returns the SimRank similarities s(u,v) …