An improvement of degree-based hashing (DBH) graph partition method, using a novel metric

Anna Mastikhina, Oleg Senkevich, Dmitry Sirotkin +2

This paper examines the graph partition problem and introduces a new metric, MSIDS (maximal sum of inner degrees squared). We establish its connection to the replication factor (RF…