Motivated by performance optimization of large-scale graph processing systems
that distribute the graph across multiple machines, we consider the balanced
graph partitioning problem. Compared to the previous work, we study the
multi-dimensional variant when balance according to multipl