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 $k$-cliques, is a fundamental algorithmic problem with many applications. Wh…