Distributed algorithms solving the updating problems

Authors:
Jung-Ho Park;Yoon-Young Park;Sung-Hee Choi
Affiliations:
Division of Computer and Information Sciences, Sun Moon University, Asan, Chungnam, Korea;Division of Computer and Information Sciences, Sun Moon University, Asan, Chungnam, Korea;Division of Computer and Information Sciences, Sun Moon University, Asan, Chungnam, Korea
Venue:
The Korean Journal of Computational & Applied Mathematics
Year:
2002

Citing 3
Cited 1

A time-optimal message-efficient distributed algorithm for depth-first-search

Information Processing Letters
Introduction to distributed algorithms

Introduction to distributed algorithms
An Incremental Distributed Algorithm for Computing Biconnected Components (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms

Methods of searching information using legacy data and variable weighted graph

ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science

Quantified Score

Hi-index	0.00

Visualization

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) log n'), its message complexity is O(n'+ a + d), the ideal time complexity is O(n'), and the space complexity is O(e log n + e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are O(u2 + a + n') respectively.