Efficient parallel algorithms for doubly convex-bipartite graphs

AbstractSuppose that G = (S, T, E) is a bipartite graph. An ordering of S(T) has the adjacency property if for each vertex in T(S), its adjacent vertices in S(T) are consecutive in the ordering. If there exist orderings of S and T which have the adjacency property, G is called a doubly convex-bipartite graph. In this paper, a parallel algorithm is proposed to recognize a doubly convex-bipartite graph. The algorithm runs in O(log n) time using O(n3log n) processors on the CRCW PRAM, or O(log2 n) time using O(n3log2 n) processors on the CREW PRAM