55 citations · 94 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Separating Structure from Noise in Large Graphs Using the Regularity Lemma
Marco Fiorucci, Francesco Pelosin, Marcello Pelillo
How can we separate structural information from noise in large graphs? To address this fundamental question, we propose a graph summarization approach based on Szemerédi's Regulari…
cs.DS2017
On the Interplay between Strong Regularity and Graph Densification
Marco Fiorucci, Alessandro Torcinovich, Manuel Curado +2
In this paper we analyze the practical implications of Szemerédi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a h…