With the continuing application of artificial intelligence (AI) technologies in decision-making,
algorithmic decision-making is becoming more efficient, often even outperforming humans …

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 …

Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …

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 …

Distributed data processing platforms such as MapReduce and Pregel have substantially
simplified the design and deployment of certain classes of distributed graph analytics …

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 …

Motivated by recent studies in the data mining community which require to efficiently list all k-
cliques, we revisit the iconic algorithm of Chiba and Nishizeki and develop the most efficient …

There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …

In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …

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 …