A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph

Abstract

Let G be a connected graph with n vertices. A spanning tree of G is an acyclic subgraph of G that has n vertices and n−1 edges. In this paper, we propose a simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph in O(log n) time with O(n/log n) processors on the EREW PRAM computational model.