Balanced graph partitioning is a critical step for many large-scale
distributed computations with relational data. As graph datasets have grown in
size and density, a range of highly-scalable balanced partitioning algorithms
have appeared to meet varied demands across different domains