Sciweavers

Share
ICCI
1993

A Distributed Algorithm for Ear Decomposition

10 years 6 months ago
A Distributed Algorithm for Ear Decomposition
A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the algorithm either the ears are correctly labeled or the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. We also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition.
Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chand
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1993
Where ICCI
Authors Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar
Comments (0)
books