By Topic

Distributed Algorithms for Constructing a Depth-First-Search Tree

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
$31 $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)
Makki, S.A.M. ; University of Queensland, USA ; Havas, G.

We present more efficient distributed depth-firstsearch algorithms which construct a depth-first-search tree for a communication network. The algorithms require left| V right|(1 + r) messages and |V|(l + r) units of time in the worst case, where left| V right| is the number of sites in the network, and 0 leqslant r le 1 . The value of r depends on the network topology and possibly on the routing chosen. In the best case, when the underlying network has a ring topology, r = 0 and our basic algorithm requires V messages and time units, regardless of routing. We extend this algorithm to achieve the same best case bound for other topologies. The worst case bound, which has r = 1¿2/left| V right|, applies if the network topology is a tree. The improvement over the best of previous algorithms is achieved by dynamic backtracking, with a minor increase in message length.

Published in:

Parallel Processing, 1994. Vol. 1. ICPP 1994. International Conference on  (Volume:3 )

Date of Conference:

15-19 Aug. 1994