✦ LIBER ✦

Depth-first search is inherently sequential

✍ Scribed by John H. Reif

Book ID: 113162753
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 419 KB
Volume: 20
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(85)90024-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Self-stabilizing depth-first search

✍ Zeev Collin; Shlomi Dolev 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 495 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

Depth-first search as a combinatorial co

Depth-first search as a combinatorial correspondence

✍ Ira Gessel; Da-Lun Wang 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 253 KB

A note on parallel depth first search

✍ Y. Zhang 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 122 KB

Yet another distributed depth-first-sear

Yet another distributed depth-first-search algorithm

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

An efficient distributed depth-first-sea

An efficient distributed depth-first-search algorithm

✍ Mohan B. Sharma; Sitharama S. Iyengar; Narasimha K. Mandyam 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 282 KB