Graph partition method based on finite projective planes

Anna Mastikhina; Dmitry Sirotkin; Oleg Kruglov; Oleg Senkevich; Stanislav Moiseev

REVIEW

Graph partition method based on finite projective planes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.13861 v1 pith:5HH77LGY submitted 2023-12-21 math.CO

Oleg Kruglov , Anna Mastikhina , Oleg Senkevich , Dmitry Sirotkin , Stanislav Moiseev This is my paper · ORCID

classification math.CO

keywords sqrtgraphpartitionalgorithmapproachesbetterboundconstrained

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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

Discussion (0). Continue with ORCID to comment.

Pith tools