scientific article; zbMATH DE number 4172414

MaRDI QIDQ3197350zbMATH OpenFDO

Authors Calvin C.-Y. Chen, Sajal K. Das

Publication date 1989

zbMATH Keywords

general treeparallel algorithmsparallel computationparallel random access machinetime complexitytraversal algorithms

Mathematics Subject Classification ID

Trees (05C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 88969
• Parallel algorithms for a depth first search and a breadth first search
• Parallel algorithms for tree traversals
• Breadth-first traversal of trees and integer sorting in parallel
• A unified approach to parallel depth-first traversals of general trees

Cited in

(8)

• Parallel algorithms for tree traversals
• A unified approach to parallel depth-first traversals of general trees
• A randomized NC algorithm for the maximal tree cover problem
• Breadth-first traversal of trees and integer sorting in parallel
• An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
• scientific article; zbMATH DE number 5942279 (Why is no real title available?)
• scientific article; zbMATH DE number 88969 (Why is no real title available?)
• scientific article; zbMATH DE number 2100400 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197350)