14 citations · 32 across the 13 of their papers we have counts for
1 paper · 1 filter
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov +2
We consider the problem of counting the number of copies of a fixed graph H within an input graph G. This is one of the most well-studied algorithmic graph problems, with many…