Now showing items 1-1 of 1
A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching
(The University of Bergen, 2013-12-09)
This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been ...