### Abstract

It is shown that isomorphism of two outerplanar graphs with n vertices can be verified on CRCW PRAM in time O(log n) using n processors. This improves the previous results of Ruzzo [R] and Miller & Reif [MR] concerning parallel isomorphism of trees.

Original language | English (US) |
---|---|

Title of host publication | Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium |

Editors | Michal P. Chytil, Vaclav Koubek, Ladislav Janiga |

Publisher | Springer Verlag |

Pages | 220-230 |

Number of pages | 11 |

ISBN (Print) | 9783540501107 |

DOIs | |

State | Published - Jan 1 1988 |

Externally published | Yes |

Event | 13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988 - Carlsbad, Serbia Duration: Aug 29 1988 → Sep 2 1988 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 324 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988 |
---|---|

Country | Serbia |

City | Carlsbad |

Period | 8/29/88 → 9/2/88 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Testing isomorphism of outerplanar graphs in parallel'. Together they form a unique fingerprint.

## Cite this

Chlebus, B. S., Diks, K., & Radzik, T. (1988). Testing isomorphism of outerplanar graphs in parallel. In M. P. Chytil, V. Koubek, & L. Janiga (Eds.),

*Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium*(pp. 220-230). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 324 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0017145