✦ LIBER ✦

A parallel algorithm for recognizing unordered depth-first search

✍ Scribed by Catherine A. Schevon; Jeffrey Scott Vitter

Book ID: 113163287
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 678 KB
Volume: 28
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90172-x

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

A note on parallel depth first search

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

A parallel depth first search branch and

A parallel depth first search branch and bound algorithm for the quadratic assignment problem

✍ Bernard Mans; Thierry Mautor; Catherine Roucairol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A new distributed Depth-First-Search alg

A new distributed Depth-First-Search algorithm

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

A random 1-011-011-01algorithm for depth

A random 1-011-011-01algorithm for depth first search

✍ A. Aggarwal; R. J. Anderson 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 695 KB

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