A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗

DOI10.1080/10637199508915484zbMath1049.68914OpenAlexW2026186969MaRDI QIDQ4820078

Rong Lin, Stephan Olariu

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199508915484

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic parallel list ranking
• A taxonomy of binary tree traversals
• Lexicographic generation of ordered trees
• An Efficient Parallel Biconnectivity Algorithm
• Enumerating, Ranking and Unranking Binary Trees
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Design, Analysis, and Implementation of a Parallel Tree Search Algorithm
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• A numbering system for binary trees

This page was built for publication: A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗