Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
Given a weighted undirected graph, a number of clusters , and an exponent , the goal in the -clustering problem on graphs is to select vertices as centers that mi…
cs.DS2025
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
Emilio Cruciani, Sebastian Forster, Tijn de Vos
We study a multi-call variant of the classic PUSH&PULL rumor spreading process where nodes can contact of their neighbors instead of a single one during both PUSH and PULL oper…