Fast counting of medium-sized rooted subgraphs

P-A. G. Maugis, S. C. Olhede, P. J. Wolfe

We prove that counting copies of any graph $F$ in another graph $G$ can be achieved using basic matrix operations on the adjacency matrix of $G$. Moreover, the resulting algorithm…