Parallel Breadth-First Search (BFS) algorithms for ordered trees and graphs on a shared memory model of a Single Instruction-stream Multiple Data-stream computer are proposed. The parallel BFS algorithm for trees comp...
详细信息
Parallel Breadth-First Search (BFS) algorithms for ordered trees and graphs on a shared memory model of a Single Instruction-stream Multiple Data-stream computer are proposed. The parallel BFS algorithm for trees computes the BFS rank of eachnode of an ordered tree consisting ofnnodes in time of 0(β logn) when 0(n1+1/β) processors are used, β being an integer greater than or equal to 2. The parallel BFS algorithm for graphs produces Breadth-First Spanning Trees (BFSTs) of a directedgraphGhavingnnodes in time 0(***) using 0(n3) processors, wheredis the diameter ofGIfGis a strongly connected graph or a connected undirected graph the BFS algorithm producesnBFSTs, each BFST having a different start node.
暂无评论