HybHuff compresses hypergraph adjacency lists by Huffman-encoding frequent symbols and bit-packing the rest, reporting up to 2.3x smaller files than zip and ZFP on four datasets at a per-dataset optimal split.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination
HybHuff compresses hypergraph adjacency lists by Huffman-encoding frequent symbols and bit-packing the rest, reporting up to 2.3x smaller files than zip and ZFP on four datasets at a per-dataset optimal split.