no code implementations • 9 Mar 2021 • Marco Bressan, Marc Roth
We study the problems of counting the homomorphisms, counting the copies, and counting the induced copies of a $k$-vertex graph $H$ in a $d$-degenerate $n$-vertex graph $G$.
Computational Complexity Data Structures and Algorithms
