Testing isomorphism of outerplanar graphs in parallel

Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik

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

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

Fingerprint

Outerplanar Graph
Isomorphism
Testing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Testing isomorphism of outerplanar graphs in parallel. / Chlebus, Bogdan S.; Diks, Krzysztof; Radzik, Tomasz.

Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. ed. / Michal P. Chytil; Vaclav Koubek; Ladislav Janiga. Springer Verlag, 1988. p. 220-230 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 324 LNCS).

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

Chlebus, BS, Diks, K & Radzik, T 1988, Testing isomorphism of outerplanar graphs in parallel. in MP Chytil, V Koubek & L Janiga (eds), Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 324 LNCS, Springer Verlag, pp. 220-230, 13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988, Carlsbad, Serbia, 8/29/88. https://doi.org/10.1007/BFb0017145
Chlebus BS, Diks K, Radzik T. Testing isomorphism of outerplanar graphs in parallel. In Chytil MP, Koubek V, Janiga L, editors, Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. Springer Verlag. 1988. p. 220-230. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0017145
Chlebus, Bogdan S. ; Diks, Krzysztof ; Radzik, Tomasz. / Testing isomorphism of outerplanar graphs in parallel. Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. editor / Michal P. Chytil ; Vaclav Koubek ; Ladislav Janiga. Springer Verlag, 1988. pp. 220-230 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fabef772734f4127b89936f9e55baf25,
title = "Testing isomorphism of outerplanar graphs in parallel",
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.",
author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Tomasz Radzik",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/BFb0017145",
language = "English (US)",
isbn = "9783540501107",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "220--230",
editor = "Chytil, {Michal P.} and Vaclav Koubek and Ladislav Janiga",
booktitle = "Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium",

}

TY - GEN

T1 - Testing isomorphism of outerplanar graphs in parallel

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Radzik, Tomasz

PY - 1988/1/1

Y1 - 1988/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85032868769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032868769&partnerID=8YFLogxK

U2 - 10.1007/BFb0017145

DO - 10.1007/BFb0017145

M3 - Conference contribution

AN - SCOPUS:85032868769

SN - 9783540501107

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

SP - 220

EP - 230

BT - Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium

A2 - Chytil, Michal P.

A2 - Koubek, Vaclav

A2 - Janiga, Ladislav

PB - Springer Verlag

ER -