Skip to main content

Parallel recognition of outerplanar graphs

  • Communications
  • Conference paper
  • First Online:
  • 134 Accesses

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

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. — R. Cole, Parallel Merge Sort, proceedings of FOCS'86, Toronto, pp 511–516.

    Google Scholar 

  2. — M. Chrobak, K. Diks, Maximum flow in outerplanar networks, submitted for publication.

    Google Scholar 

  3. — K. Diks, A fast parallel algorithm for six-colouring of planar graphs, MFCS'86, LNCS 233, Springer Verlag (1986), pp 273–282.

    Google Scholar 

  4. — K. Diks, unpublished result.

    Google Scholar 

  5. — R. E. Tarjan, U. Vishkin, Finding biconnected componenets and computing tree functions in logarithmic parallel time, proceedings FOCS'84, pp 14–20.

    Google Scholar 

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

    Google Scholar 

  7. — U. Vishkin, An efficient parallel strong orientation, Technical Report #109, Computer Science Department, New York University, New York, New York, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diks, K. (1987). Parallel recognition of outerplanar graphs. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics