Parallel breadth-first search algorithms for trees and graphs
Publication:3318124
DOI10.1080/00207168408803413zbMath0534.68045OpenAlexW2140391860MaRDI QIDQ3318124
G. P. Bhattacharjee, Ratan K. Ghosh
Publication date: 1984
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168408803413
directed graphparallel algorithmtime complexityundirected graphordered treesSIMDshared memory modelatomic treeBreadth-First Spanning TreesParallel Breadth-First Search algorithmsSingle Instruction-stream Multiple Data-stream computer
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)
Related Items (8)
Cites Work
This page was built for publication: Parallel breadth-first search algorithms for trees and graphs