# Fast counting of medium-sized rooted subgraphs

31 Dec 2016P-A. G. MaugisS. C. OlhedeP. 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 is competitive for medium-sized $F$: our algorithm recovers the best known complexity for rooted 6-clique counting and improves on the best known for 9-cycle counting... (read more)

PDF Abstract

No code implementations yet. Submit your code now