A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

References

• |ADG92| Arora , A. , Dolev , S. and Gouda , M. , ( 1992 ). “Maintaining digital clocks in step” , Parallel Processing Letters , 1 ( 1 ), 11 – 18 .
   Google Scholar
• |AMO93| Ahuja , R. K. , Magnanti , T. L. and Orlin , J. B. , ( 1993 ). Network Flows. Prentice-Hall , Englewood Cliffs , New Jersey .
   Google Scholar
• |BGW89| Brown , G. M. , Gouda , M. G. and Wu , C. L. , ( June 1989 ). “Token systems that self-stabilize” , IEEE Trans. Comput. , 38 ( 6 ), 845 – 852 .
   Web of Science ®Google Scholar
• |CD94| Collin , Z. and Dolev , S. , ( 1994 ). “Self-stabilizing depth-first search” , Information Processing Letters , 49 , 297 – 301 .
   Google Scholar
• |CS94| Chandrasekar , S. Srimani , P. K. ( 1994 ). “A self-stabilizing distributed algorithm for all-pairs shortest path problem” , Parallel Algorithms and Applications , 4 ( 1 & 2 ), 125 – 137 .
   Google Scholar
• |Dij74| Dijkstra , E. W. ( Nov. 1974 ). “Self-stabilizing systems in spite of distributed control” , Communications of the ACM , 17 ( 11 ), 643 – 644 .
   Web of Science ®Google Scholar
• |Dij86| Dijkslra. , E. W. ( 1986 ). “A belated proof of self-stabilization” , J. of Distributed Computing , 1 ( 1 ), 5 – 6 .
   Web of Science ®Google Scholar
• |FD94| Flatebo , M. and Datta , A. K. ( June 1994 ). “Two state self stabilizing algorithms for token rings” , IEEE Transactions on Software Engineering , 20 ( 6 ), 500 – 504 .
   Web of Science ®Google Scholar
• |GH90| Gouda , M. and Herman , T. ( t1990 ). “Stabilizing unison” , Inf. Processing Letters , 35 ( 4 ), 171 – 175 .
   Web of Science ®Google Scholar
• |GP93| Gopal , A. S. and Perry , K. J. ( 1993 ). “Unifying self-stabilization and fault-tolerance” , In Proceedings of the 12th Symposium on Principles of Distributed Computing , pages 195 – 206 , Ithaca , New York .
   Google Scholar
• |Har72| Harary , F. ( 1972 ). Graph Theory , ( Addison-Wesley ), Reading , MA .
   Google Scholar
• |Hua93| Huang , S. T. ( July 1993 ). “Leader election in uniform rings” , ACM Transactions on Programming Languages and Systems , 15 ( 3 ), 563 – 573 .
   Web of Science ®Google Scholar
• |Kes88| Kessels , J. L. W. ( 1988 ). “An exercise in proving self-stabilization with a variant function” , Inf. Processing Letters , 29 ( 2 ), 39 – 42 .
   Web of Science ®Google Scholar
• |KP93| Katz , S. and Perry , K. J. ( 1993 ). “Self-stabilizing extensions for message passing systems” , Distributed Computing , 7 ( 1 ), 17 – 26 .
   Web of Science ®Google Scholar
• |Lam84| Lamport , L. ( 1984 ). Solved problems, unsolved problems, and non-problems in concurrency . In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing , 1 – 11 .
   Google Scholar
• |Sch93| Schneider , M. ( Mar. 1993 ). “Self-stabilization” , ACM Computing Surveys , 25 ( 1 ) 45 – 67 .
   Web of Science ®Google Scholar
• |Tel94| Tel , G. ( 1994 ). Introduction to Distributed Algorithms , ( Cambridge University Press ).
   Google Scholar