Parallel Graph Algorithms Based Upon Broadcast Communications


In this paper, we shall show some common guidelines which we can use to design parallel algorithms under the single-channel broadcast communication model. We use several graph problems as a vehicle. The graph problems we solve include topological ordering, the connected component problem, breadth-first search, and depth-first search. If an ideal conflict… (More)
DOI: 10.1109/12.61071


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics