Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1988: Mathematical Foundations of Computer Science 1988 pp 220–230Cite as

Testing isomorphism of outerplanar graphs in parallel

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft, & J. D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. A. Apostolico, C.S. Iliopoulos & R. Paige, An O(n log n) cost parallel algorithm for the single function coarsest partition problem, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987.

    Google Scholar 

  3. R. Cole, Parallel mergesort, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, Toronto (Canada), 1987, pp. 511–516.

    Google Scholar 

  4. K. Diks, Parallel recognition of outerplanar graphs, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987, pp. 105–113.

    Google Scholar 

  5. M. R. Garey & D. S. Johnson, "Computers and Intractability: a Guide to the Theory of NP-Completeness", Freeman, San Francisco, CA, 1979.

    Google Scholar 

  6. F. Harary, "Graph Theory", Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

  7. S. MacLane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3 (1937), 340–472.

    Google Scholar 

  8. G. L. Miller & J. H. Reif, Parallel tree contraction and its application, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 478–489.

    Google Scholar 

  9. W. L. Ruzzo, On uniform circuit complexity, J. Computer System Sci. 22 (1981).

    Google Scholar 

  10. R. Tarjan & U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), 862–874.

    Google Scholar 

  11. U. Vishkin, Synchronous parallel computations — a survey, Technical Report #71, Computer Science Department, New York University, New York, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki PKiN, VIIIp, Uniwersytet Warszawski, 00-901, Warszawa, Poland

    Bogdan S. Chlebus, Krzysztof Diks & Tomasz Radzik

Authors
  1. Bogdan S. Chlebus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Diks
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomasz Radzik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S., Diks, K., Radzik, T. (1988). Testing isomorphism of outerplanar graphs in parallel. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017145

Download citation

  • DOI: https://doi.org/10.1007/BFb0017145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation