A well-known combinatorial optimization problem is the graph partitioning problem. Since solving it optimally requires very much time, we have to settle for approximated methods. One such method is the multilevel k-way ...