Breadth-First Search (BFS) is a key graph algorithm with many important applications. In this
work, we focus on a special class of graph traversal algorithm-concurrent BFS-where …

When studying dynamic networks, it is often of interest to understand how the community
structure of the network changes. However, before studying the community structure of …

One of the most important structures in social networks is communities. Understanding
communities is useful in many applications, such as suggesting a friend for a user in an …

Network data is ubiquitous in a variety of domains such as mobile computing,
telecommunications, and social networks. In order to analyze these networks of data for …

The concept of graph has been around since Euler brought up the Seven Bridges of
Knigsberg problem in 1736. Recent years have seen graph computing regains its …

A recurrent challenge for modern applications is the processing of large datasets [13, 28,
106]. Two kinds of large datasets are constantly encountered in contemporary applications …