1 citations · 1 across the 1 of their papers we have counts for
1 paper
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…