Author:
Chaudhuri Pranay,Thompson Hussein
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics
Reference29 articles.
1. Afek, Y., Kutten, S., Yung, M.: Memory-efficient self-stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) Proceedings of Distributed Algorithms. LNCS, vol. 486, pp. 15–28. Springer, Berlin (1990)
2. Antonoiu, G., Srimani, P.K.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Proceedings of Euro-Par’97: Parallel Processing. LNCS, vol. 1300, pp. 480–487. Springer, Berlin (1997)
3. Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 20–26 (2003)
4. Bodlaender H.L., Kloks T., Tan R.B., Leeuwen J.V.: Approximations for λ-colorings of graphs. Comput. J. 47, 193–204 (2004)
5. Bruell S.C., Ghosh S., Karaata M.H., Pemmaraju S.V.: Self-stabilizing algorithms for finding centers and medians of trees. SIAM J. Comput. 29, 600–614 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献