An Optimal Distributed Algorithm for Computing Bridge-Connected

  title={An Optimal Distributed Algorithm for Computing Bridge-Connected},
  author={Pranay Chaudhuri},
  journal={Comput. J.},
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


Publications referenced by this paper.

Corrections to a distributed depth-"rst search algorithm

  • D. Kumar, S. S. Iyenger, M. B. Sharma
  • Info. Process. Lett.,
  • 1990
Highly Influential
4 Excerpts

An ef"cient distributed depth-"rst search algorithm

  • M. B. Sharma, S. S. Iyenger, N. K. Mandyam
  • Info. Process. Lett.,
  • 1989
Highly Influential
6 Excerpts

Distributed processing of graphs: fundamental cycles algorithm

  • P. Chaudhuri
  • Info. Sci.,
  • 1992
1 Excerpt

Parallel algorithms for connectivity problems in graph theory

  • R. K. Ghosh
  • Int. Comput. Math.,
  • 1986
2 Excerpts

An ef"cient parallel biconnectivity algorithm. TR-69

  • R. E. Tarjan, U. Vishkin
  • Ultracomputer Note-51,
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…