Graph partition method based on finite projective planes
arXiv:2312.13861
Abstract
We present a novel graph partition algorithm with a theoretical bound for the replication factor of \sqrt(n), which improves known constrained approaches (grid: 2* \sqrt(n)-1, torus: 1.5*\sqrt(n)+1) and provides better performance
12 pages, 9 figures