Counting Hypertriangles through Hypergraph Orientations
cs.DS, cs.DB, cs.SI
Submitted: 2026-01-07
Updated: 2026-11-09
Code: https://github.com/daniel-paul/DITCH
Terminology
Sources
- The Parametrised Complexity of Counting Small Sub-Hypergraphs
- Uncovering Biological Network Function via Graphlet Degree Signatures
- Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
- Motif Counting in Complex Networks: A Comprehensive Survey
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles