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.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…
cs.DS2024
Temporal queries for dynamic temporal forests
Davide Bilò, Luciano Gualà, Stefano Leucci +2
In a temporal forest each edge has an associated set of time labels that specify the time instants in which the edges are available. A temporal path from vertex to vertex i…