Graph Partitioning Algorithms: A Comparative Study
摘要
One of the classic problems related to graphs is partitioning their vertices into subsets, consisting of composing groups with high connectivity. The graph partitioning problem is of interest since the amount of data generated today is gigantic, and the importance of determining groups is essential for making strategic decisions in several areas. This paper compares the main graph partitioning methods found in the literature, considering the minimum cut criteria and load balancing factors in different types of graphs.