首页|Graph partition method based on finite projective planes

Graph partition method based on finite projective planes

来源：

英文摘要

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

作者：Stanislav Moiseev、Anna Mastikhina、Oleg Kruglov、Oleg Senkevich、Dmitry Sirotkin

作者单位：

学科分类：计算技术、计算机技术

推荐引用：Stanislav Moiseev,Anna Mastikhina,Oleg Kruglov,Oleg Senkevich,Dmitry Sirotkin.Graph partition method based on finite projective planes[EB/OL].(2023-12-21)[2025-08-24].https://arxiv.org/abs/2312.13861.点此复制

Graph partition method based on finite projective planes

Graph partition method based on finite projective planes

评论