Cover Image

HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Tianyu, Zhao, Dongfang, Guo, Luanzheng, Tallent, Nathan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

QuaRs: A Transform for Better Lossless Compression of Integers
by: Matt, Jonas G.
Published: (2025)

Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)

Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)

A Lossless Deamortization for Dynamic Greedy Set Cover
by: Solomon, Shay, et al.
Published: (2024)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
by: Singh, Rajpreet, et al.
Published: (2025)

Hyper-distance Oracles in Hypergraphs
by: Preti, Giulia, et al.
Published: (2023)

Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)

$\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling
by: Fischer, Nick, et al.
Published: (2025)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
by: Yan, Shuyi
Published: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2025)

Transitivity Preserving Projection in Directed Hypergraphs
by: Parsonage, Eric, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification of Hypergraphs
by: Goranci, Gramoz, et al.
Published: (2025)

Hypergraph Unreliability in Quasi-Polynomial Time
by: Cen, Ruoxu, et al.
Published: (2024)

Engineering Hypergraph $b$-Matching Algorithms
by: Großmann, Ernestine, et al.
Published: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2026)

Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
by: Bucić, Matija, et al.
Published: (2025)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
by: Forster, Sebastian, et al.
Published: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
by: Chhabra, Adil, et al.
Published: (2025)

Almost Tight Bounds for Online Hypergraph Matching
by: Tröbst, Thorben, et al.
Published: (2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)

Improved Certificates for Independence Number in Semirandom Hypergraphs
by: Kothari, Pravesh, et al.
Published: (2026)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
by: Kenneth, Yotam, et al.
Published: (2023)

Private Lossless Multiple Release
by: Andersson, Joel Daniel, et al.
Published: (2025)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
by: Yoshida, Yuichi
Published: (2026)

A Lower Bound for the Max Entropy Algorithm for TSP
by: Jin, Billy, et al.
Published: (2023)

Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
by: Amarilli, Antoine, et al.
Published: (2025)

New Graph and Hypergraph Container Lemmas with Applications in Property Testing
by: Blais, Eric, et al.
Published: (2024)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
by: Lanzinger, Matthias, et al.
Published: (2023)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
by: Khanna, Sanjeev, et al.
Published: (2024)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
by: Großmann, Ernestine, et al.
Published: (2026)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
by: Khanna, Sanjeev, et al.
Published: (2025)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)