The k-truss is a type of cohesive subgraphs proposed recently for the study of networks.
While the problem of computing most cohesive subgraphs is NP-hard, there exists a …

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 …

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

Community search is important in graph analysis and can be used in many real applications.
In the literature, various community models have been proposed. However, most of them …

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 …

Maximal clique enumeration is a fundamental problem in graph theory and has been
extensively studied. However, maximal clique enumeration is time-consuming in large …

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 detection is one of the most fundamental problems in social network analysis,
while most existing research focuses on unsigned graphs. In real applications, social …

Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has
numerous important applications. Though extensively studied, most existing algorithms …

Triangle listing is one of the fundamental algorithmic problems whose solution has
numerous applications especially in the analysis of complex networks, such as the …