An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs

Authors:
Shan-Chyun Ku;Biing-Feng Wang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China
Venue:
Journal of Parallel and Distributed Computing
Year:
2002

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Relations between concurrent-write models of parallel computation

SIAM Journal on Computing
Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
A simple O(log N) time parallel algorithm for testing isomorphism of maximal outerplanar graphs

Journal of Parallel and Distributed Computing
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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 outer-planarity. 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.