Specifically, Graph Partitioning (GP), i.e., the determination of communities, or clusters, within the nodes of a graph has proven to be a useful method in network analysis [1]}. In fact, GP approaches emerged to reduce the complexity of applications generally involving graph sizes arbitrarily large compared to the computational resources at hand, by dividing (partitioning) the graph into smaller sub-graphs or sub-problems, and thus increase the computational performance [2]}.
