Fig. 2From: DHPV: a distributed algorithm for large-scale graph partitioningIllustration of an example of partitioning : a the partitioning is shoddy, the vertices are assigned randomly, there are more cut-edges between partitions; b the partitioning is almost optimal, the highly connected vertices reside in the same partition, there is less cut-edges [22]Back to article page