arXiv Analytics

Sign in

arXiv:1402.7326 [math.CO]AbstractReferencesReviewsResources

Analysis of the parallel peeling algorithm: a short proof

Pu Gao

Published 2014-02-28Version 1

A recent paper by Jiang, Mitzenmacher and Thaler upper bounded the number of rounds needed in a parallel peeling algorithm applied to a random hypergraph whose edge density is below the k-core emergence threshold. I gave a very short proof of their result in this note.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:0911.2809 [math.CO] (Published 2009-11-14, updated 2012-03-06)
A short proof of the tree-packing theorem
arXiv:0710.3044 [math.CO] (Published 2007-10-16, updated 2007-10-26)
A Short Proof of the VPN Tree Routing Conjecture on Ring Networks
arXiv:2206.14309 [math.CO] (Published 2022-06-28)
Linear-sized minors with given edge density

Links

Toolbox