Graph partition method based on finite projective planes
Abstract
We present a novel graph partition algorithm with a theoretical bound for the replication factor of (n), which improves known constrained approaches (grid: 2* (n)-1, torus: 1.5*(n)+1) and provides better performance
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.