Publisher
Springer International Publishing
Reference46 articles.
1. 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)
2. Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Fast network decompositions and covers. J. Parallel Distrib. Comput. 39(2), 105–114 (1996)
3. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proceedings of 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 364–369 (1989)
4. Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of 31st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503–513 (1990)
5. Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J.: Lower bounds for maximal matchings and maximal independent sets. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong-Diameter Network Decomposition;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21