
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 110118, February, 2000.  
BibTex  x  
@article{ 10.1109/71.841748, author = {Art Kazmierczak and Sridhar Radhakrishnan}, title = {An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {2}, issn = {10459219}, year = {2000}, pages = {110118}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.841748}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing IS  2 SN  10459219 SP110 EP118 EPD  110118 A1  Art Kazmierczak, A1  Sridhar Radhakrishnan, PY  2000 KW  Distributed algorithm KW  message complexity KW  ear decomposition KW  biconnectivity testing KW  outerplanarity testing KW  depth first search. VL  11 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bidirectional network containing
[1] B. Awerbuch, “A New Distributed DepthFirst Search Algorithm,” Information Processing Letters, vol. 20, no. 3, pp. 147150, 1985.
[2] G.N. Frederickson and R. Janardan, “Designing Networks with Compact Routing Table,” Algorithmica, vol. 3, pp. 171190, 1988.
[3] G.N. Frederickson, “A New Approach to All Pairs Shortest Paths in Planar Graphs,” Proc. 19th ACM STOC, pp. 1928, 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 MinimumWeight Spanning Trees,” ACM TOPLAS, vol. 5, no. 1, pp. 6677, 1983.
[6] F. Harary, Graph Theory. AddisonWesley, 1969.
[7] W. Hohberg, “How to Find Biconnected Components in Dstributed Networks,” J. Parallel and Distributed Computing, vol. 9, pp. 374386, 1990.
[8] I. Cidon, “Yet Another Distributed DepthFirstSearch Algorithm,” Information Processing Letters, vol. 26, no. 6, pp. 301305, Jan. 1988.
[9] R. Janardan, “SpaceEfficient and FaultTolerant Message Routing in Outerplanar Networks,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,5291,540, Dec. 1988.
[10] R. Janardan and S.W. Cheng, “Efficient Distributed Algorithms for SingleSource Shortest Paths and Related Problems in Plane Networks,” Math. Systems Theory, vol. 25, pp. 93122, 1992.
[11] A. Kanevsky and V. Ramachandran, “Improved Algorithms for Graph FourConnectivity,” Proc. 28th Ann. IEEE FOCS, 1987.
[12] K.B. Lakshmanan, N. Meenakshi, and K. Thulasiraman, “A Time Optimal MessageEfficient Distributed Algorithm for DepthFirst Search,” Information Processing Letters, vol. 25, no. 2, pp. 103109, May 1987.
[13] G.L. Miller and V. Ramachandran, “A New Graph Triconnectivity Algorithm and Its Parallelization,” Proc. 19th Ann. ACM STOC, pp. 335344, 1987.
[14] S. Rajanarayanan, S.S. Iyengar, S. Radhakrishnan, and R.L. Kashyap, “An Optimal Distributed Algorithm for Recognizing MeshConnected 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. 3342, 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. 235257, June 1992.
[20] M.B. Sharma, S.S. Iyengar, and N.K. Mandyam, “An Efficient Distributed DepthFirstSearch Algorithm,” Information Processing Letters, vol. 32, no. 4, pp. 183186, Sept. 1989.
[21] H. Whitney, “NonSeparable and Planar Graphs,” Trans. Am. Math. Soc., vol. 34, pp. 339–362, 1932.