A self-stabilizing algorithm for the st-order problem

References

• Aho , A. , Hopcroft , J. and Ullman , J. 1974 . The Design and Analysis of Computer Algorithms , Boston : Addison-Wesley .
   Google Scholar
• Antonoiu , G. and Srimani , P.K. 1997 . “ Distributed self-stabilizing algorithm for minimum spanning tree construction ” . In Euro-Par'97 Parallel Processing, Proceedings LNCS: 1300 , 480 – 487 . Berlin : Springer-Verlag .
   Google Scholar
• Aranha , R.F.M. and Pandu Rangan , C. 1995 . An efficient distributed algorithm for st-numbering the vertices of a biconnected graph . Journal of Universal Computer Science , 1 : 633 – 650 .
   Google Scholar
• Chaudhuri , P. 1999 . A self-stabilizing algorithm for detecting fundamental cycles in a graph . Journal of Computer and System Sciences , 59 : 84 – 93 .
   Google Scholar
• Chen , N.S. , Yu , H.P. and Huang , S.T. 1991 . A self-stabilizing algorithm for constructing spanning trees . Information Processing Letters , 39 : 147 – 151 .
   Web of Science ®Google Scholar
• Collin , Z. and Dolev , S. 1994 . Self-stabilizing depth-first search . Information Processing Letters , 49 : 297 – 301 .
   Google Scholar
• Dijkstra , E.W. 1974 . Self-stabilizing systems in spite of distributed control . Communications of the ACM , 17 : 643 – 644 .
   Web of Science ®Google Scholar
• Dolev , S. 2000 . Self-stabilization , Cambridge : MIT Press .
   Google Scholar
• Dolev , S. , Israeli , A. and Moran , S. 1993 . Self-stabilization of dynamic systems assuming only read/write atomicity . Distributed Computing , 7 : 3 – 16 .
   Google Scholar
• Ebert , J. 1983 . st-ordering the vertices of biconnected graphs . Computing , 30 : 19 – 33 .
   Google Scholar
• Gairing , M. 2004 . Distance-two information in self-stabilizing algorithms . Parallel Processing Letters , 14 : 387 – 398 .
   Google Scholar
• Hedetniemi , S.T. , Jacobs , D.P. and Srimani , P.K. 2003 . Linear time self-stabilizing colorings . Information Processing Letters , 87 : 251 – 255 .
   Google Scholar
• Hsu , S.C. and Huang , S.T. 1992 . A self-stabilizing algorithm for maximal matching . Information Processing Letters , 43 : 77 – 81 .
   Google Scholar
• Huang , S.T. and Chen , N.S. 1992 . A self-stabilizing algorithm for constructing breadth-first trees . Information Processing Letters , 41 : 109 – 117 .
   Google Scholar
• Karaata , M.H. and Chaudhuri , P. 1999 . A self-stabilizing algorithm for bridge finding . Distributed Computing , 12 : 47 – 53 .
   Google Scholar
• Karaata , M.H. and Chaudhuri , P. 2002 . A dynamic self-stabilizing algorithm for constructing a transport net . Computing , 68 : 143 – 161 .
   Google Scholar
• Mizuno , M. and Nesterenko , M. 1998 . A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments . Information Processing Letters , 66 : 285 – 290 .
   Google Scholar
• Y. Sakurai, F. Ooshita, and T. Masuzawa, A self-stabilizing link-coloring protocol resilient to Byzantine faults in tree networks, 8th International Conference On Principles of Distributed Systems (OPODIS 2004) 15–17 December 2004, Grenoble, France
   Google Scholar
• Schneider , M. 1993 . Self-stabilization . ACM Computing Surveys , 25 : 45 – 67 .
   Web of Science ®Google Scholar