Paul Pena, D. (CSE) – Efficient Pattern Counting in Sparse Graphs and Hypergraphs
Pattern counting is a fundamental problem in computer science with applications in many domains. For a fixed small pattern H, we are given a large graph G and we are […]