5 citations · 5 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Fast and Accurate Triangle Counting in Graph Streams Using Predictions
Cristian Boldrin, Fabio Vandin
In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room…
cs.DS2024★ 5 cited
Scalable Temporal Motif Densest Subnetwork Discovery
Ilie Sarpe, Fabio Vandin, Aristides Gionis
Finding dense subnetworks, with density based on edges or more complex structures, such as subgraphs or -cliques, is a fundamental algorithmic problem with many applications. Wh…