References
- B. Awerbuch : 'Complexity of network synchronization,' Journal of ACM. Vol 32, No.4, pp.804-823(Oct. 1985) https://doi.org/10.1145/4221.4227
- B Awerbuch and R. G. Gallager. 'A new distributed algorithm to find breadth first search trees,' IEEE Trans on Information Theory, Vol.IT-33, No.3, pp.315- 322(1987) https://doi.org/10.1109/TIT.1987.1057314
- B. Awerbuch : 'Distributed shortest paths algorithm,' Proc. of 21st Symposium on Theory of Computing. pp.490-500(1980)
- M. Ahuja and Y. Zhu : 'An efficient distributed algorithms for finding articulation points, bridges and biconnected components in asynchronous network,' In Proc. 9th Conference on Foundations of Software Technology and Theoretical Computer Science(LNCS 405), pp.99-108(1989) https://doi.org/10.1007/3-540-52048-1_36
- T H. Cormen, C. E Lerserson and R. L. Rivest: 'Introduction to Algorithms,' The MIT Press(1990)
- J. Park, T. Masuzawa, K Hagihara and N. Tokura : 'An efficient distributed algorithm for breadth first spanning tree problem,' Journal of IEICE(D). Vol. J71-D, No.7, pp.l576-1188(1988)
- B. Swaminathan and K. J Goldman: 'An incremental distributed algorithm: for computing biconnected components,' Proc. 8th International Workshop on Distributed Algorithms(LNCS 857), pp. 238-252(1994)
- T. Kameda and M Yamashita : 'Distributed Algorithms,' Kindai-Kagaku-sya(l994)
- J. Park, C. Lee : 'An Algorithm Solving the Biconnected-components Reconstruction Problem,' Journal of KIPS,' Vol.5, No,10. pp.2512-2520(1998)