๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A time-optimal message-efficient distributed algorithm for depth-first-search

โœ Scribed by K.B. Lakshmanan; N. Meenakshi; K. Thulasiraman

Book ID
113163153
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
496 KB
Volume
25
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Distributed algorithms for depth-first s
Distributed algorithms for depth-first search
โœ S.A.M. Makki; George Havas ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient than previous methods. Our algorithms require 21VI -2 messages and units of time in the worst case, where IV1 is the number of sites in the network, and as little as IV1