辨識序列平行圖的平行演算法

Abstract

An efficient parallel algorithm for constructing a decomposition tree of given generalized-series-parallel (GSP) graphs is presented. IT takes O(logn) time with C(m,n) processors on a CRCW PRAM, where C(m,m)is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time. The class of GSP graphs belongs to the decomposable graphs which can be represented by their decomposition trees. Given a decomposition tree of a GSP graph there are many graph-theoretic problems can be solved efficiently. In this paper, we also derive some interesting properties for GSP graphs based on their structure characterizations.