70 citations · 207 across the 23 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2021★ 15 cited
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks
Ilie Sarpe, Fabio Vandin
Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are a…
cs.SI2021
PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts
Ilie Sarpe, Fabio Vandin
The identification and counting of small graph patterns, called network motifs, is a fundamental primitive in the analysis of networks, with application in various domains, from so…