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 CPU cache performance is one of the key issues to efficiency in database systems. It is
reported that cache miss latency takes a half of the execution time in database systems. To …

Community search is a fundamental graph mining task. Unfortunately, most previous
community search studies focus mainly on identifying communities in a network without …

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 …

We study the problem of structural graph clustering, a fundamental problem in managing
and analyzing graph data. Given an undirected unweighted graph, structural graph …

Routing attacks remain practically effective in the Internet today as existing countermeasures
either fail to provide protection guarantees or are not easily deployable. Blockchain systems …

The problem of community search, which aims to find a cohesive subgraph containing user-
given query vertices, has been extensively studied recently. Most of the existing studies …

The model of k-core and its decomposition have been applied in various areas, such as
social networks, the world wide web, and biology. A graph can be decomposed into an …