The Power of Bidegeneracy for Hypergraph Data Structures
cs.DS, cs.DB, cs.DM
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/openai/math
Terminology
Sources
- BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
- Counting Hypertriangles through Hypergraph Orientations
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- 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