The Community for Technology Leaders
Subscribe
Issue No.02 - February (2000 vol.11)
pp: 110-118
ABSTRACT
<p><b>Abstract</b>—We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bi-directional network containing <tmath>$n$</tmath>-nodes and <tmath>$m$</tmath>-links which uses <tmath>$O(m)$</tmath> messages and which can be completed in <tmath>$O(n)$</tmath> time. Using the ear decomposition, we obtain the following results for a distributed network: 1) The distributed ear decomposition algorithm can be used to test biconnectivity, determine biconnected components, find cutpoints and bridges using <tmath>$O(m)$</tmath> messages in <tmath>$O(n)$</tmath> time. 2) The distributed ear decomposition algorithm can be used to test if a biconnected network is outerplanar using <tmath>$O(n)$</tmath> messages in <tmath>$O(n)$</tmath> time, and if the network is outerplanar, the embedding is also given using the same message and time complexity.</p>
INDEX TERMS
Distributed algorithm, message complexity, ear decomposition, biconnectivity testing, outerplanarity testing, depth first search.
CITATION
Art Kazmierczak, Sridhar Radhakrishnan, "An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing", IEEE Transactions on Parallel & Distributed Systems, vol.11, no. 2, pp. 110-118, February 2000, doi:10.1109/71.841748