Testing isomorphism of outerplanar graphs in parallel

Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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 languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium
EditorsMichal P. Chytil, Vaclav Koubek, Ladislav Janiga
PublisherSpringer Verlag
Pages220-230
Number of pages11
ISBN (Print)9783540501107
DOIs
StatePublished - Jan 1 1988
Externally publishedYes
Event13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988 - Carlsbad, Serbia
Duration: Aug 29 1988Sep 2 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume324 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988
CountrySerbia
CityCarlsbad
Period8/29/889/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