New algorithms HTCount and HTCount-P estimate hyper-triangle counts under memory limits, but their unbiasedness proof relies on a uniform-sampling lemma that fails when hyperedge sizes vary.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
New algorithms HTCount and HTCount-P estimate hyper-triangle counts under memory limits, but their unbiasedness proof relies on a uniform-sampling lemma that fails when hyperedge sizes vary.