3 papers
cs.DS2026
Detecting Large Quasi-cliques on Dynamic Networks
Luciano GualÃ, Simone Pellegrini, Luca Pepè Sciarria +1
Motivated by the problem of detecting large and cohesive groups of vertices in real networks, the task of finding large \emph{quasi-cliques} has attracted considerable attention ac…
cs.DS2026
A Tour of Locality Sensitive Filtering on the Sphere
Luca Becchetti, Andrea Clementi, Luciano Gualà +5
The Approximate Near Neighbor (ANN) problem is a cornerstone of high-dimensional data analysis. While Locality Sensitive Hashing (LSH) has been the classical paradigm, recent work…
cs.DS2025
Approximate -hop neighborhoods on incremental graphs: An efficient lazy approach
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
In this work, we propose, analyze and empirically validate a lazy-update approach to maintain accurate approximations of the -hop neighborhoods of dynamic graphs resulting from…