By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kazmierczak, A. ; Dept. of Comput. Sci., Texas Univ., Tyler, TX, USA ; Radhakrishnan, S.

We present an asynchronous distributed algorithm to determine an ear decomposition of an arbitrary, connected, bidirectional 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

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:11 ,  Issue: 2 )