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 …

Community search is a problem of finding densely connected subgraphs that satisfy the
query conditions in a network, which has attracted much attention in recent years. However …

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 …

Given a scientific collaboration network, how can we find a group of collaborators with high
research indicator (eg, h-index) and diverse research interests? Given a social network, how …

Community search has aroused widespread interest in the past decades. Among existing
solutions, the learning-based models exhibit outstanding performance in terms of accuracy …

Mining dense subgraphs from a large graph is a fundamental graph mining task and can be
widely applied in a variety of application domains such as network science, biology, graph …

Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are
pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a …

With the proliferation of graph applications, the problem of efficiently computing all k-edge
connected components of a graph G for a user-given k has been recently investigated. In …

Community search is a problem of finding densely connected subgraphs that satisfy the
query conditions in a network, which has attracted much attention in recent years. However …

Given a graph G and a set Q of query nodes, we examine the Steiner Maximum-Connected
Subgraph (SMCS). The SMCS, or G's induced subgraph that contains Q with the largest …