Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Eyubov, Kamal"'
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge (hyper)graphs using low computatio
Externí odkaz:
http://arxiv.org/abs/2302.06259
