1 paper
Giorgio Venturin, Ilie Sarpe, Fabio Vandin
Triangle counting is a fundamental and widely studied problem on static graphs, and recently on temporal graphs, where edges carry information on the timings of the associated even…