Graph algorithms

On the Interplay between Strong Regularity and Graph Densification
We investigate Szemerédi’s Regularity Lemma as a tool to preserve metric information in large graphs
Marco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo
Cite DOI
On the Interplay between Strong Regularity and Graph Densification