Blair Sullivan & Felix Reidl: Complex networks and sparsity III
Algorithmic problems & their 'sparsity solution': motif counting
We present several approaches to exploiting bounded expansion in order to count induced subgraphs ('motifs') and how these algorithms translate into practice.
