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

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kruglov, Oleg, Mastikhina, Anna, Senkevich, Oleg, Sirotkin, Dmitry, Moiseev, Stanislav
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
DOI:10.48550/arxiv.2312.13861