4 papers
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…
A Tour of Locality Sensitive Filtering on the Sphere
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
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…
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…
Finding Diameter-Reducing Shortcuts in Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
In the \emph{-Diameter-Optimally Augmenting Tree Problem} we are given a tree of vertices as input. The tree is embedded in an unknown \emph{metric} space and we have un…