AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY-Reference-Cited by-同舟云学术

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

Published:2006-06 Issue:03 Volume:17 Page:677-701
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

TSIN YUNG H.¹

Affiliation:

1. School of Computer Science, University of Windsor, Windsor, Ontario, Canada, N9B 3P4, Canada

Abstract

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054106004042

Reference13 articles.

1. An efficient distributed algorithm for centering a spanning tree of a biconnected graph

2. An Optimal Distributed Algorithm for Computing Bridge-Connected Components

3. How to find biconnected components in distributed networks

4. An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast computation of small cuts via cycle space sampling;ACM Transactions on Algorithms;2011-09

2. SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS;International Journal of Foundations of Computer Science;2011-08

3. Fast Distributed Computation of Cuts Via Random Circulations;Automata, Languages and Programming;2008

4. A Self-stabilizing Algorithm For 3-Edge-Connectivity;Parallel and Distributed Processing and Applications;2007