Abstract
In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n′ +a +d) logn′), its message complexity is O(n′ +a +d), the ideal time complexity isO(n′), and the space complexity isO(e logn +e′ logn′). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity areO(u 2 +a +n′) respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. B. Laksmanan, N. Meenakshi, and K. Thulasiraman,A time optimal message efficient distributed algorithm for depth first search, Information Processing Letters,25, pp.103–109, 1987.
J.Park T.Masuzawa, K.Hagihara, and N.Tokura,Efficient distributed algorithms solving problems about the connectivity of network(in Japanese), Journal of IEICE(DI), pp.343–356, 1989.
B.Swaminathan and K.J.Goldman,An incremental, distributed algorithm for computing biconnected components, In Proc. 8th International Workshop on Distributed Algorithm, pp.238–252, 1994.
G. Tel,Introduction to Distributed Algorithms, Cambridge University Press, 1994.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Park, JH., Park, YY. & Choi, SH. Distributed algorithms solving the updating problems. Korean J. Comput. & Appl. Math. 9, 437–450 (2002). https://doi.org/10.1007/BF03021552
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03021552