Abstract

In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1) determining whether a graph G is bipartite, and (2) determining whether a bipartite graph G is convex. Our algorithms require O(log p) andO(log 2 p) communication rounds, respectively, and linear sequential work per round on a CGM with p processors and N=p local memory per processor, N=jGj. The algorithms assume that N p p for some xed>0, which is true for all commercially available multiprocessors. Our results imply BSP algorithms with O(log p) andO(log 2 p) supersteps, respectively, O(g log(p) N

Citations