Abstract.
This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst-case communication complexity of O(b+c) messages for an edge insertion and O(b'+c) messages for an edge removal, and a worst-case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the connected components during the operation, b is the number of nodes in the biconnected component containing the new edge, and b' is the number of nodes in the biconnected component just before the deletion.
The algorithm is presented in two stages. First, a serial algorithm is presented in which topology updates occur one at a time. Then, building on the serial algorithm, an algorithm is presented in which concurrent update requests are serialized within each connected component. The problem is motivated by the need to implement causal ordering of messages efficiently in a dynamically changing communication structure.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 1995; revised February 1997.
Rights and permissions
About this article
Cite this article
Swaminathan, B., Goldman, K. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs . Algorithmica 22, 305–329 (1998). https://doi.org/10.1007/PL00009226
Issue Date:
DOI: https://doi.org/10.1007/PL00009226