An Optimal Distributed Edge-Biconnectivity Algorithm

Details An Optimal Distributed Edge-Biconnectivity Algorithm An Optimal Distributed Edge-Biconnectivity Algorithm

2006-02-05

arxiv.org/abs/cs/0602013v1

Computer Science

Distributed, Parallel, and Cluster Computing

Submitted to PODC 2006. Contains a pstricks figure

Scientific paper

We describe a synchronous distributed algorithm which identifies the edge-biconnected components of a connected network. It requires a leader, and uses messages of size O(log |V|). The main idea is to preorder a BFS spanning tree, and then to efficiently compute least common ancestors so as to mark cycle edges. This algorithm takes O(Diam) time and uses O(|E|) messages. Furthermore, we show that no correct singly-initiated edge-biconnectivity algorithm can beat either bound on any graph by more than a constant factor. We also describe a near-optimal local algorithm for edge-biconnectivity.

Affiliated with

Also associated with

No associations

Rating

An Optimal Distributed Edge-Biconnectivity Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimal Distributed Edge-Biconnectivity Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Distributed Edge-Biconnectivity Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730495