Brief Announcement-Reference-Cited by-同舟云学术

Brief Announcement

Published:2018-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Boppana Ravi B.¹,Halldórsson Magnús M.²,Rawitz Dror³

Affiliation:

1. Massachusetts Institute of Technology, Cambridge, MA, USA

2. Reykjavik University, Reykjavik, Iceland

3. Bar-Ilan University, Ramat Gan, Israel

Funder

Israel Science Foundation

Icelandic Research Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3212734.3212793

Reference18 articles.

1. Noga Alon . 2010. On Constant Time Approximation of Parameters of Bounded Degree Graphs Property Testing - Current Research and Surveys. 234--239. Noga Alon . 2010. On Constant Time Approximation of Parameters of Bounded Degree Graphs Property Testing - Current Research and Surveys. 234--239.

2. A fast and simple randomized parallel algorithm for the maximal independent set problem

3. Noga Alon and Joel H Spencer . 2016. The probabilistic method (bibinfoeditionfourth ed.). John Wiley & Sons. Noga Alon and Joel H Spencer . 2016. The probabilistic method (bibinfoeditionfourth ed.). John Wiley & Sons.

4. Per Austrin Subhash Khot and Muli Safra . 2009. Inapproximability of vertex cover and independent set in bounded degree graphs 24th IEEE CCC. 74--80. 10.1109/CCC.2009.38 Per Austrin Subhash Khot and Muli Safra . 2009. Inapproximability of vertex cover and independent set in bounded degree graphs 24th IEEE CCC. 74--80. 10.1109/CCC.2009.38

5. Nikhil Bansal Anupam Gupta and Guru Guruganesh . 2015. On the Lovász Theta function for Independent Sets in Sparse Graphs 47th ACM STOC. 193--200. 10.1145/2746539.2746607 Nikhil Bansal Anupam Gupta and Guru Guruganesh . 2015. On the Lovász Theta function for Independent Sets in Sparse Graphs 47th ACM STOC. 193--200. 10.1145/2746539.2746607