o strike a happy medium of both efficiency
and fidelity in their work. Traditional Zoltan-PHG is well suited to minimize
the number of cut hyperedges in the system, but it is comparatively slow due
to the multiple layers of coarsening it goes through and the standard matching
methods used to calculate new vertices for the coarser hypergraph.


<p>
Hypergraph partitioning is a useful partitioning and
load balancing method when connectivity data is available. It can be
viewed as a more sophisticated alternati