An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

Authors: Ku S-C.; Wang B-F.

Source: Journal of Parallel and Distributed Computing, Volume 62, Number 2, February 2002 , pp. 221-227(7)

Buy & download fulltext article:

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

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 O(log n) time using O(n) work. Besides being optimal, it is very simple. Moreover, it can be implemented optimally on the CRCW PRAM in O(1) time. © 2002 Elsevier Science (USA).

Keywords: maximal outerplanar graphs; isomorphism; parallel algorithms; PRAM

Language: English

Document Type: Research article

Affiliations: Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, 30043, Republic of China

Publication date: 2002-02-01