Load balancing and orientability thresholds for random hypergraphs
From MaRDI portal
Publication:2875136
DOI10.1145/1806689.1806705zbMath1293.05245arXiv1009.5489OpenAlexW2008159222MaRDI QIDQ2875136
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.5489
Related Items (8)
Sandwiching a densest subgraph by consecutive cores ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Matching recovery threshold for correlated random graphs ⋮ Orientability Thresholds for Random Hypergraphs ⋮ Thresholds for extreme orientability ⋮ A new approach to the orientation of random hypergraphs ⋮ The densest subgraph problem in sparse random graphs
This page was built for publication: Load balancing and orientability thresholds for random hypergraphs