✦ LIBER ✦

A new distributed breadth-first-search algorithm

✍ Scribed by Yunzhou Zhu; To-Yat Cheung

Book ID: 113163133
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 367 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90208-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new distributed Depth-First-Search alg

A new distributed Depth-First-Search algorithm

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

Temporal resolution using a breadth-firs

Temporal resolution using a breadth-first search algorithm

✍ Clare Dixon 📂 Article 📅 1998 🏛 Springer Netherlands 🌐 English ⚖ 258 KB

Shortest path algorithms using dynamic b

Shortest path algorithms using dynamic breadth-first search

✍ Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 1022 KB

A new O(nm) label-correcting algorithm is presented for finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs or finding a directed cycle of negative length. In this algorithm, a node is scanned on the k-th scanning step only if its "label depth"-i.e., the le

Breadth-first heuristic search

✍ Rong Zhou; Eric A. Hansen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Salembier's Min-tree algorithm turned in

Salembier's Min-tree algorithm turned into breadth first search

✍ Wim H. Hesselink 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Yet another distributed depth-first-sear

Yet another distributed depth-first-search algorithm

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