An Efficient Parallel Algorithm for Constructing a Spanning Tree on Trapezoid Graphs

Abstract

Let g=(V , E) be a connected graph of n vertices and m edges. The problem of constructing a spanning tree is to find an acyclic ssubgraph of G with n-1 edges. In this paper, we propose an efficient parallel algorithm for solving this problem on trapezoid graphs. Our algorithm runs in O(log n) time with O(n/ log n) processors on the EREW PRAM mode