𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computationally Optimal Metric-First Code Tree Search Algorithms

✍ Scribed by Mohan, S.; Anderson, J.

Book ID
117912627
Publisher
IEEE
Year
1984
Tongue
English
Weight
779 KB
Volume
32
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Depth-first iterative-deepening: An opti
Depth-first iterative-deepening: An optimal admissible tree search
✍ Richard E. Korf πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 686 KB

The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iterative-deepening algor

An optimal EREW parallel algorithm for c
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
✍ H.S. Chao; F.R. Hsu; R.C.T. Lee πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM