2 citations · 9 across the 8 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.DS2018★ 1 cited
Graph Compression Using The Regularity Method
Francesco Pelosin
We are living in a world which is getting more and more interconnected and, as physiological effect, the interaction between the entities produces more and more information. This h…