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 …

Densest subgraph discovery (DSD) is a fundamental problem in graph mining. It has been
studied for decades, and is widely used in various areas, including network science …

Attributed community search aims to find the community with strong structure and attribute
cohesiveness from attributed graphs. However, existing works suffer from two major …

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 …

As a result of the expeditious advancement of biomedical technologies, a plethora of
relational data linking biomedical entities such as genes, proteins, and drugs have been …

In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …

Community search in heterogeneous information networks (HINs) has attracted much
attention in graph analysis. Given a vertex, the goal is to find a densely-connected sub …

Community search, which aims to retrieve important communities (ie, subgraphs) for a given
query vertex, has been widely studied in the literature. In the recent, plenty of research is …

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 …