References
- Chaudhuri , P. 1999 . A self-stabilizing algorithm for minimum-depth search of graphs . Inf. Sci. , 118 : 241 – 249 .
- Collin , Z. and Dolev , S. 1994 . Self-stabilizing depth-first search . Inf. Process. Lett. , 49 : 297 – 301 .
- Huang , S. T. and Chen , N. S. 1992 . A self-stabilizing algorithm for constructing breadth-first trees . Inf. Process. Lett. , 41 : 109 – 117 .
- Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Reading, MA : Addison-Wesley .
- Chaudhuri , P. 1987 . Fast parallel algorithms for a class of graph problems . J. Combinat. Inf. Syst. Sci. , 12 : 51 – 67 .
- Chaudhuri , P. 1988 . Fast parallel graph searching with applications . BIT , 28 : 2 – 18 .
- Chen , C. C.Y. , Das , S. K. and Akl , S. G. 1991 . A unified approach to parallel depth-first traversals of general trees . Inf. Process. Lett. , 38 : 49 – 55 .
- Ghosh , R. K. and Bhattacharjee , G. P. 1984 . Parallel breadth-first search algorithms for trees and graphs . Int. J. Comput. Math. , 15 : 255 – 268 .
- Dijkstra , E. W. 1974 . Self-stabilizing systems in spite of distributed control . Commun. ACM , 17 : 643 – 644 .
- Chaudhuri , P. 1999 . A self-stabilizing algorithm for detecting fundamental cycles in a graph . J. Comput. Sys. Sci. , 59 : 84 – 93 .
- Chen , S. , Yu , H. P. and Huang , S. T. 1991 . A self-stabilizing algorithm for constructing spanning trees . Inf. Process. Lett. , 39 : 147 – 151 .
- Hedetniemi , S. T. , Jacobs , D. P. and Srimani , P. K. 2003 . Linear time self-stabilizing colorings . Inf. Process. Lett. , 87 : 251 – 255 .
- Karaata , M. H. and Chaudhuri , P. 1999 . A self-stabilizing algorithm for bridge finding . Distrib. Comput. , 12 : 47 – 53 .