Disconnected components detection and rooted shortest-path tree maintenance in networks

Abraham, 2008, Compact name-independent routing with minimum stretch, ACM Trans. Algorithms, 4, 37, 10.1145/1367064.1367077 Afek, 1993, Self-stabilization over unreliable communication media, Distrib. Comput., 7, 27, 10.1007/BF02278853 Altisen, 2014, Self-stabilizing leader election in polynomial steps, vol. 8736, 106 Arora, 1990, Composite routing protocols, 70 Bein, 2007, Self-stabilizing local routing in ad hoc networks, Comput. J., 50, 197, 10.1093/comjnl/bxl059 Blin, 2010, Loop-free super-stabilizing spanning tree construction, vol. 6366, 50 Boulinier, 2004, When graph theory helps self-stabilization Chandrasekar, 1994, A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms Appl., 4, 125, 10.1080/10637199408915459 Chen, 1991, A self-stabilizing algorithm for constructing spanning trees, Inform. Process. Lett., 39, 147, 10.1016/0020-0190(91)90111-T Cobb, 2002, Stabilization of general loop-free routing, J. Parallel Distrib. Comput., 62, 922, 10.1006/jpdc.2001.1830 Cobb, 2009, Stabilization of maximal-metric routing without knowledge of network size, 306 Cournier, 2009, Light enabling snap-stabilization of fundamental protocols, ACM Trans. Auton. Adapt. Syst., 4, 10.1145/1462187.1462193 Cournier, 2011, The first fully polynomial stabilizing algorithm for BFS tree construction, vol. 7109, 159 Datta, 2013, Self-stabilizing silent disjunction in an anonymous network, vol. 7730, 148 Datta, 2011, Self-stabilizing leader election in optimal space under an arbitrary scheduler, Theoret. Comput. Sci., 412, 5541, 10.1016/j.tcs.2010.05.001 Dolev, 2011, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, Inf. Process. Lett., 111, 912, 10.1016/j.ipl.2011.06.010 Dolev, 1993, Self-stabilization of dynamic systems assuming only read/write atomicity, Distrib. Comput., 7, 3, 10.1007/BF02278851 Gavoille, 2013, On the communication complexity of distributed name-independent routing schemes, 418 Glacet, 2014, Disconnected components detection and rooted shortest-path tree maintenance in networks, vol. 8736, 120 Huang, 2005, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, J. Comput. Syst. Sci., 71, 70, 10.1016/j.jcss.2004.12.011 Huang, 2005, A self-stabilizing algorithm for the shortest path problem assuming the distributed demon, Comput. Math. Appl., 50, 671, 10.1016/j.camwa.2005.05.002 Huang, 1992, A self-stabilizing algorithm for constructing breadth-first trees, Inform. Process. Lett., 41, 109, 10.1016/0020-0190(92)90264-V Huang, 1993, Self-stabilizing depth-first token circulation on networks, Distrib. Comput., 7, 61, 10.1007/BF02278857 Huang, 2002, A self-stabilizing algorithm for the shortest path problem in a distributed system, Comput. Math. Appl., 43, 103, 10.1016/S0898-1221(01)00276-0 Johnen, 1995, Distributed self-stabilizing depth-first token circulation with constant memory, 4.1 Johnen, 2003, Route preserving stabilization, vol. 2704, 184 Leon-Garcia, 2004