Highly Influenced

7 Excerpts

@article{Chaudhuri1997AnOD, title={An Optimal Distributed Algorithm for Computing Bridge-Connected}, author={Pranay Chaudhuri}, journal={Comput. J.}, year={1997}, volume={40}, pages={200-207} }

- Published in Comput. J. 1997
DOI:10.1093/comjnl/40.4.200

Consider a connected undirected graph G =< N , E >, where N is the set of n nodes, and E is the set of e edges. Without loss of generality, I assume N to be {1, 2, . . . , n}. An edge (i, j) ∈ E is a bridge of G if the removal of (i, j) disconnects G. Clearly, the removal of a bridge increases the number of connected components of a graph by one. The bridge-connected components problem consists of "nding the maximal connected subgraphs of G such that none of the subgraphs contains a bridge. The… CONTINUE READING