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 asked to count the number of subgraphs or homomorphisms (edge-preserving maps) of H in G. For practical applications where the input graph can be very […]