Funder
NSF
US–Israel Binational Science Foundation
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference39 articles.
1. A fast and simple randomized parallel algorithm for the maximal independent set problem;Alon;J. Algorithms,1986
2. Coloring graphs with sparse neighborhoods;Alon;J. Comb. Theory, Ser. B,1999
3. Distributed (Δ+1)-coloring in linear (in Δ) time;Barenboim,2009
4. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash–Williams decomposition;Barenboim;Distrib. Comput.,2010
5. The locality of distributed symmetry breaking;Barenboim,2012
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献