Proposed a parallelization strategy using MPI for inter-node communication, OpenMP for intra-node parallelism, and METIS for graph partitioning. Presentation slides are available in ...

When using process-parallel-edges and collapse-expand together, and there would be a loop edge is generated that can not be removed, and the edge label is displayed on the collapsed combo directly ...

Acceleration of large-scale graph processing by FPGA has been proved an energy efficient method, especially in edge computation scenarios. FPGA acceleration of graph calculation includes inter ...

Abstract: This paper proposes a novel parallel neighborhood expansion-based algorithm for graph edge partitioning aimed at addressing computational efficiency and scalability issues in large-scale ...

We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface ... efficiency ...

Furthermore, the quality of the partitions produced is comparable (edge-cuts within 5%) to those produced by the serial multilevel k-way algorithm. Thus our parallel algorithm makes it feasible to ...