An Optimal Distributed Edge-Biconnectivity Algorithm
| dc.creator | Pritchard, David | |
| dc.date | 2006-02-05 | |
| dc.date.accessioned | 2026-07-07T07:02:28Z | |
| dc.date.available | 2026-07-07T07:02:28Z | |
| dc.description | 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. | |
| dc.description | Submitted to PODC 2006. Contains a pstricks figure | |
| dc.identifier | https://arxiv.org/abs/cs/0602013 | |
| dc.identifier | http://arxiv.org/abs/cs/0602013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108611 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | An Optimal Distributed Edge-Biconnectivity Algorithm | |
| dc.type | text |