In a new paper titled “Efficiently counting complex multilayer temporal motifs in large-scale networks” we detail our approach to counting multilayer temporal motifs in networks with partial timing. The code (see Bitbucket) builds upon the well-known Stanford Network Analysis (SNAP) package.

• H.D. Boekhout, W.A. Kosters and F.W. Takes, Efficiently Counting Complex Multilayer Temporal Motifs in Large-Scale Networks, Computational Social Networks 6: 8, Springer, 2019.