Subgraph enumeration is important for many applications such as network motif discovery
and community detection. Recent works utilize graphics processing units (GPUs) to …

Distributed graph analysis usually partitions a large graph into multiple small-sized
subgraphs and distributes them into a cluster of machines for computing. Therefore, graph …

Parallel traffic simulation requires partitioning the road network into several components that
can be assigned to different computing nodes (CPNs). Existing studies focus more on …

In many global businesses of multinational enterprises, graph-structure data is usually
geographically distributed in different regions to support low-latency services. Geo …

Finding the shortest path from a source vertex to any other vertices on a graph (single-
source shortest path, SSSP) is used in a wide range of applications. With the rapid …

Distributed graph systems often leverage a cluster of machines by partitioning a large graph
into multiple small-size subgraphs. Thus, graph partition usually has a significant impact on …

Prioritized computation is shown promising performance for a large class of graph
algorithms. It prioritizes the execution of some vertices that play important roles in …

The performance of SDN-based LEO satellite networks significantly depends on the control
domain division approaches. The dynamical topology in LEO networks results in the time …

During the past 10 years, there has been a surging interest in developing distributed graph
processing systems. This tutorial provides a comprehensive review of existing distributed …