๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A SimpleO(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

โœ Scribed by Srabani Sen Gupta; Bhabani P. Sinha

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
195 KB
Volume
56
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
โœ Shan-Chyun Ku; Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB

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 th