English

Graph partition method based on finite projective planes

Combinatorics 2023-12-22 v1

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

Keywords

Cite

@article{arxiv.2312.13861,
  title  = {Graph partition method based on finite projective planes},
  author = {Oleg Kruglov and Anna Mastikhina and Oleg Senkevich and Dmitry Sirotkin and Stanislav Moiseev},
  journal= {arXiv preprint arXiv:2312.13861},
  year   = {2023}
}

Comments

12 pages, 9 figures

R2 v1 2026-06-28T13:58:42.798Z