Author:
Boppana Ravi B.,Halldórsson Magnús M.,Rawitz Dror
Publisher
Springer International Publishing
Reference26 articles.
1. Lecture Notes in Computer Science;N Alon,2010
2. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)
3. Alon, N., Spencer, J.H.: The Probabilistic Method, 4th edn. Wiley, Hoboken (2016)
4. Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: 24th IEEE CCC, pp. 74–80 (2009)
5. Bansal, N., Gupta, A., Guruganesh, G.: On the Lovász theta function for independent sets in sparse graphs. In: 47th ACM STOC, pp. 193–200 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs;Lecture Notes in Computer Science;2023
2. Distributed Algorithms for Fractional Coloring;Structural Information and Communication Complexity;2021
3. Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31
4. Hardness of Distributed Optimization;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16