Clique counting is a well studied problem in low memory models like graph streaming. There are algorithms which provide good space complexity bounds for general graphs. For constant pass, approximation algorithms counting ...