Skip Navigation

The Computer Journal 1997 40(4):200-207; doi:10.1093/comjnl/40.4.200
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chaudhuri, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Optimal Distributed Algorithm for Computing Bridge-Connected Components

P. Chaudhuri

Department of Electrical and Computer Engineering, Kuwait University, PO Box 5969, Safat, Kuwait Email: pranay{at}eng.kuniv.edu.kw

In this paper I present a distributed algorithm that finds 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.

Received March 14, 1997. revised June 28, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.