Expanders via Local Edge Flips

DOI10.1137/1.9781611974331.ch19zbMath1410.68271arXiv1510.07768OpenAlexW2949352163MaRDI QIDQ4575596

Zeyuan Allen Zhu, Lorenzo Orecchia, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07768

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Expansion and flooding in dynamic random networks with node churn ⋮ The flip Markov chain for connected regular graphs ⋮ A triangle process on regular graphs

This page was built for publication: Expanders via Local Edge Flips