✦ LIBER ✦

An efficient distributed depth-first-search algorithm

✍ Scribed by Mohan B. Sharma; Sitharama S. Iyengar; Narasimha K. Mandyam

Book ID: 113163350
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 282 KB
Volume: 32
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90041-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A time-optimal message-efficient distrib

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

✍ K.B. Lakshmanan; N. Meenakshi; K. Thulasiraman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Yet another distributed depth-first-sear

Yet another distributed depth-first-search algorithm

✍ Isreal Cidon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A new distributed Depth-First-Search alg

A new distributed Depth-First-Search algorithm

✍ Baruch Awerbuch 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 244 KB

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

An efficient distributed algorithm for g

An efficient distributed algorithm for game tree search

✍ Sun Wei; Ma Shaohan 📂 Article 📅 1996 🏛 Wuhan University 🌐 English ⚖ 223 KB

Some remarks on distributed depth-first

Some remarks on distributed depth-first search

✍ Y.H Tsin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 76 KB