Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: IEEE Symposium on Foundations of Computer Science, pp. 364–369 (1989)
2. Linial, N., Saks, M.: Decomposing graphs into regions of small diameter. In: SODA 1991: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, pp. 320–330. SIAM, Philadelphia (1991)
3. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356–374 (1996)
4. Peleg, D.: Distributed computing: a locality-sensitive approach. In: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)
5. Krzywdziński, K.: Distributed algorithm finding regular clustering in unit disc graphs,
http://atos.wmid.amu.edu.pl/kkrzywd/research/REGULAR.pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献