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

A systolic algorithm for extracting regions from a planar graph

โœ Scribed by Zen-Chung Shih; R.C.T. Lee; S.N. Yang

Publisher
Elsevier Science
Year
1989
Weight
866 KB
Volume
47
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A systolic algorithm for extracting regi
A systolic algorithm for extracting regions from a planar graph: Zen-Chung Shih. Department and Institute of Information Science, National Chiao Tung University, Hsinchu 30050, Taiwan, Republic of China. R. C. T. Lee. Institute of Computer and Decision Sciences, National Tsing Hua University, Hsinchu 30043, Taiwan and Academia Sinica, Nankang, Taipei, Republic of China. S. N. Yang. Institute of Computer and Decision Sciences, National Tsing Hua University, Hsinchu 30043, Taiwan, Republic of China. Received January 6, 1988; accepted January 4, 1989
๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science โš– 90 KB
A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
โœ Hillel Gazit; John H Reif ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph ลฝ ลฝ 2 . 1 q โ‘€ which can be computed by known algorithms in O log n time with