Presents O(n) query algorithms for hypergraph connected components and subquadratic bounds for k-connectivity in linear hypergraphs via cut oracles, bypassing exact reconstruction barriers.
Learning a hidden hypergraph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles
Presents O(n) query algorithms for hypergraph connected components and subquadratic bounds for k-connectivity in linear hypergraphs via cut oracles, bypassing exact reconstruction barriers.