Introduction
Graph partition is the reduction of graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges of the original paths cross between the groups will produce edges in the partitioning graph. If the number of
resulting edges is small compared to the original graph, then the partitioned graph may be better suited for analysis and problem-solving than the original.