An efficient algorithm is presented in this paper that finds the bridg
es of a connected undirected graph on a distributed or network model o
f computation. The algorithm uses O(n) messages and O(n) units of time
, where n is the number of nodes of the graph.