This Article 
 Bibliographic References 
 Add to: 
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing
February 2000 (vol. 11 no. 2)
pp. 110-118

Abstract—We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bi-directional network containing $n$-nodes and $m$-links which uses $O(m)$ messages and which can be completed in $O(n)$ 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 $O(m)$ messages in $O(n)$ time. 2) The distributed ear decomposition algorithm can be used to test if a biconnected network is outerplanar using $O(n)$ messages in $O(n)$ time, and if the network is outerplanar, the embedding is also given using the same message and time complexity.

[1] B. Awerbuch, “A New Distributed Depth-First Search Algorithm,” Information Processing Letters, vol. 20, no. 3, pp. 147-150, 1985.
[2] G.N. Frederickson and R. Janardan, “Designing Networks with Compact Routing Table,” Algorithmica, vol. 3, pp. 171-190, 1988.
[3] G.N. Frederickson, “A New Approach to All Pairs Shortest Paths in Planar Graphs,” Proc. 19th ACM STOC, pp. 19-28, May 1987.
[4] D. Fussell, V. Ramachandran, and R. Thurimella, “Finding Triconnected Components by Local Replacement,” Proc. ICALP’89, pp. 379–393, 1989.
[5] R. Gallager, P. Humblet, and P. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees,” ACM TOPLAS, vol. 5, no. 1, pp. 66-77, 1983.
[6] F. Harary, Graph Theory. Addison-Wesley, 1969.
[7] W. Hohberg, “How to Find Biconnected Components in Dstributed Networks,” J. Parallel and Distributed Computing, vol. 9, pp. 374-386, 1990.
[8] I. Cidon, “Yet Another Distributed Depth-First-Search Algorithm,” Information Processing Letters, vol. 26, no. 6, pp. 301-305, Jan. 1988.
[9] R. Janardan, “Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,529-1,540, Dec. 1988.
[10] R. Janardan and S.W. Cheng, “Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems in Plane Networks,” Math. Systems Theory, vol. 25, pp. 93-122, 1992.
[11] A. Kanevsky and V. Ramachandran, “Improved Algorithms for Graph Four-Connectivity,” Proc. 28th Ann. IEEE FOCS, 1987.
[12] K.B. Lakshmanan, N. Meenakshi, and K. Thulasiraman, “A Time Optimal Message-Efficient Distributed Algorithm for Depth-First Search,” Information Processing Letters, vol. 25, no. 2, pp. 103-109, May 1987.
[13] G.L. Miller and V. Ramachandran, “A New Graph Triconnectivity Algorithm and Its Parallelization,” Proc. 19th Ann. ACM STOC, pp. 335-344, 1987.
[14] S. Rajanarayanan, S.S. Iyengar, S. Radhakrishnan, and R.L. Kashyap, “An Optimal Distributed Algorithm for Recognizing Mesh-Connected Networks,” Theoretical Computer Science, 1993.
[15] V. Ramachandran, “Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity,” Synthesis of Parallel Algorithms, J.H. Reif, ed., 1991.
[16] V. Ramachandran and J. Reif, “Planarity Testing in Parallel,” technical report, Univ. Texas at Austin, 1990.
[17] V. Ramachandran and U. Vishkin, “Efficient Parallel Triconnectivity in Logarithmic Time,” VLSI Algorithms and Architecture, pp. 33-42, 1988.
[18] K.V.S. Ramarao, “Distributed Algorithms for Network Recognition Problems,” IEEE Trans. Computers, vol. 38, no. 9, Sept. 1989.
[19] K.V.S Ramarao and S. Venkatesan, “On Finding and Updating Shortest Paths Distributively,” J. Algorithms, vol. 13, no. 2, pp. 235-257, June 1992.
[20] M.B. Sharma, S.S. Iyengar, and N.K. Mandyam, “An Efficient Distributed Depth-First-Search Algorithm,” Information Processing Letters, vol. 32, no. 4, pp. 183-186, Sept. 1989.
[21] H. Whitney, “Non-Separable and Planar Graphs,” Trans. Am. Math. Soc., vol. 34, pp. 339–362, 1932.

Index Terms:
Distributed algorithm, message complexity, ear decomposition, biconnectivity testing, outerplanarity testing, depth first search.
Art Kazmierczak, Sridhar Radhakrishnan, "An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 2, pp. 110-118, Feb. 2000, doi:10.1109/71.841748
Usage of this product signifies your acceptance of the Terms of Use.