Skip to main content
SpringerLink
Log in

On the communication complexity of planarity

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

Abstract

We prove θ(n log n) bound for the deterministic communication complexity of the graph property planarity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. A.Hajnal, W.Maass, G.Turán, On the communication complexity of graph properties, Proc. 20-th STOC (1988), pp.186–191.

    Google Scholar 

  2. C.M. Papadimitriu, M. Sipser, Communication complexity, JCSS 28 (1984), pp. 260–269.

    Google Scholar 

  3. A. Yao, Some complexity questions related to distributed computing, Proc. 11-th STOC (1979), pp. 209–213.

    Google Scholar 

Download references

Authors
  1. P. Ďuriš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ďuriš, P., Pudlák, P. (1989). On the communication complexity of planarity. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation