Publisher： Academic Press
ISSN： 0743-7315
Source： Journal of Parallel and Distributed Computing, Vol.62, Iss.2, 2002-02, pp. : 221-227
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on the EREW PRAM for testing isomorphism of two maximal outerplanar graphs. The proposed algorithm takes
Related content
Access to resources
Recommend
A simple recognition of maximal planar graphs
By Nagamochi H. Suzuki T. Ishii T.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery, Vol. 21, Iss. 3, 2010-11 ,pp. :
Optimal parallel algorithms for path problems on planar graphs
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
An optimal parallel algorithm for digital curve segmentation
By Damaschke P.
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :