162 citations · 185 across the 3 of their papers we have counts for
1 paper · 1 filter
Amogh Lonkar, Scott Beamer
Counting instances of specific subgraphs in a larger graph is an important problem in graph mining. Finding cliques of size k (k-cliques) is one example of this NP-hard problem. Di…