Near-linear time subhypergraph counting in bounded degeneracy hypergraphs

Daniel Paul-Pena, C. Seshadhri

Counting small patterns in a large dataset is a fundamental algorithmic task. The most common version of this task is subgraph/homomorphism counting, wherein we count the number of…