Leader Election and Centers and Medians in Tree Networks-Reference-Cited by-同舟云学术

Leader Election and Centers and Medians in Tree Networks

Published:2013 Issue: Volume: Page:113-132
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Datta Ajoy K.,Larmore Lawrence L.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-03089-0_9

Reference10 articles.

1. Antonoiu, G., Srimani, P.K.: A self-stabilizing leader election algorithm for tree graphs. J. Parallel Distrib. Comput. 34(2), 227–232 (1996)

2. Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm to find the center of a tree graph. Parallel Algorithms Appl. 10(3-4), 237–248 (2007)

3. Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm to find the median of a tree graph. Journal of Computer and System Sciences 58(1), 215–221 (1999)

4. Xu, Z., Srimani, P.K.: Self-stabilizing anonymous leader election in a tree. Int. J. Found. Comput. Sci. 17(2), 323–336 (2006)

5. Blair, J.R., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon;Journal of Parallel and Distributed Computing;2018-07

2. Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees;Parallel Processing Letters;2018-03

3. A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon;2015 IEEE International Parallel and Distributed Processing Symposium;2015-05

4. Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks;Proceedings of the 2015 International Conference on Distributed Computing and Networking;2015-01-04