In this paper I present a distributed algorithm that "nds the bridge-connected components of a connected undirected graph. The algorithm uses O(n) messages and O(n) units of time, where n is the number of nodes in the graph. It is shown that the algorithm is optimal in communication complexity to within a constant factor.
Chaudhuri REF proposed a distributed algorithm (TOKEN) for cut detection with O(N ) messages and time units.
An optimal distributed algorithm for computing bridge-connected components
Computer Journal
Computer Science