Parallel breadth-first search algorithms for trees and graphs
From MaRDI portal
Publication:3318124
DOI10.1080/00207168408803413zbMath0534.68045MaRDI 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 graph; parallel algorithm; time complexity; undirected graph; ordered trees; SIMD; shared memory model; atomic tree; Breadth-First Spanning Trees; Parallel Breadth-First Search algorithms; Single Instruction-stream Multiple Data-stream computer
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
68N25: Theory of operating systems
Related Items
Fast parallel graph searching with applications, A unified approach to parallel depth-first traversals of general trees, Breadth-first traversal of trees and integer sorting in parallel, Parallel search algorithms for graphs and trees, Efficient parallel algorithms for parameterized problems, On the Parameterized Parallel Complexity and the Vertex Cover Problem, Parallel algorithms for a depth first search and a breadth first search, Parallel algorithms for connectivity problems in graph theory
Cites Work
