Distributed Computation of Sparse Cuts via Random Walks-Reference-Cited by-同舟云学术

Distributed Computation of Sparse Cuts via Random Walks

Published:2015-01-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2015 International Conference on Distributed Computing and Networking
language:
Short-container-title:

Author:

Sarma Atish Das¹,Molla Anisur Rahaman²,Pandurangan Gopal³

Affiliation:

1. eBay Research Labs, eBay Inc., CA, USA

2. Department of Computer Science, University of Freiburg, Freiburg, Germany

3. Department of Computer Science, University of Houston, Houston TX 77204

Funder

United States-Israel Binational Science Foundation (BSF)

Singapore Ministry of Education (MOE) Academic Research Fund (AcRF)

Nanyang Technological University

Publisher

ACM

Link

Reference38 articles.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

4. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16

5. Local Mixing Time: Distributed Computation and Applications;2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2018-05