Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
Abstract
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 occurrences of a small pattern graph \(H\) in an input graph \(G\). The study of this problem is a field in and of itself. Recently, both in theory and practice, there has been an interest in hypergraph algorithms, where \(G = (V,E)\) is a hypergraph. One can view \(G\) as a set system where hyperedges are subsets of the universe \(V\).
Fields of Study & Subjects
Graph Theory and Algorithms
Time Series Analysis and Forecasting
Bayesian Methods and Mixture Models
Publication details
- Journal / source
- Society for Industrial and Applied Mathematics eBooks
- Pages
- 3652–3687
- Publication date
- 1 January 2026
- Language
- EN