Advertisement

On the communication complexity of planarity

  • P. Ďuriš
  • P. Pudlák
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 380)

Abstract

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    C.M. Papadimitriu, M. Sipser, Communication complexity, JCSS 28 (1984), pp. 260–269.Google Scholar
  3. [3]
    A. Yao, Some complexity questions related to distributed computing, Proc. 11-th STOC (1979), pp. 209–213.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • P. Ďuriš
  • P. Pudlák

There are no affiliations available

Personalised recommendations