Funder
Icelandic Centre for Research
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Locality in distributed graph algorithms;Linial;SIAM J. Comput.,1992
2. Simple distributed Δ+1-coloring of graphs;Johansson;Inf. Process. Lett.,1999
3. The locality of distributed symmetry breaking;Barenboim;J. ACM,2016
4. A new technique for distributed symmetry breaking;Schneider,2010
5. (2Δ−1)-edge-coloring is much easier than maximal matching in the distributed setting;Elkin,2015
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17