Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks-Reference-Cited by-同舟云学术

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks

Published:2014 Issue: Volume: Page:120-134
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Christian Glacet,Nicolas Hanusse,David Ilcinkas,Colette Johnen

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-11764-5_9

Reference17 articles.

1. Altisen, K., Cournier, A., Devismes, S., Durand, A., Petit, F.: Self-stabilizing leader election in polynomial steps. Technical Report hal-00980798, VERIMAG, MIS, LIP6, INRIA Rocquencourt (April 2014), http://hal.archives-ouvertes.fr/hal-00980798

2. Arora, A., Gouda, M.G., Herman, T.: Composite routing protocols. In: The 2nd IEEE Symposium on Parallel and Distributed Processing (SPDP 1990), pp. 70–78 (1990)

3. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3), 37 (2008)

4. Bein, D., Datta, A.K., Villain, V.: Self-stabilizing local routing in ad hoc networks. The Computer Journal 50(2), 197–203 (2007)

5. Lecture Notes in Computer Science;L. Blin,2010

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

1. Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations;Lecture Notes in Computer Science;2023

2. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions;Algorithmica;2021-11-05

3. Disconnected components detection and rooted shortest-path tree maintenance in networks;Journal of Parallel and Distributed Computing;2019-10

4. Self-Stabilizing Distributed Cooperative Reset;2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS);2019-07

5. Introduction to Distributed Self-Stabilizing Algorithms;Synthesis Lectures on Distributed Computing Theory;2019-04-15