2 papers
cs.DS2024
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…
cs.LO2024
First order complexity of finite random structures
Danila Demin, Maksim Zhukovskii
For a sequence of random structures with -element domains over a relational signature, we define its first order (FO) complexity as a certain subset in the Banach space $\ell^{\…