Skip to main content
SpringerLink
Log in

A fast parallel algorithm for six-colouring of planar graphs

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

Abstract

We present a parallel algorithm for colouring outer-planar graphs with minimal possible number of colours (at most 3). The algorithm runs in O(log n) time, O(n) space and uses O(n) processors on a concurrent-read concurrent-write (CRCW) parallel random access machine, where n is the number of vertices of a given graph. As an application we obtain a six-colouring parallel algorithm for planar graphs running on the same model of parallel computations in O(log n) time, O(n3) space and using O(n4) processors.

(Extended abstract)

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6.References

  1. — M. Ajtai, J. Komlos, E. Szemeredi, An O(nlog n) sorting network, Combinatorica 3,1 (1983), 1–19

    Google Scholar 

  2. — C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973

    Google Scholar 

  3. — F. Bauernoppel, H. Jung, Fast parallel vertex colouring, Proc. 5th Conference on Fundamentals of Computation, LNCS 199, Springer-Verlag, 1985, 28–35

    Google Scholar 

  4. — K. Diks, Parallel recognition of outer-planar graphs, paper in preparation

    Google Scholar 

  5. — N. Chiba, T. Nishizeki, N. Saito, A linear algorithm for five colouring a planar graph, Proc. 1980 Symosium on graph theory and algorithms, LNCS 108, Springer-Verlag, 1981, 9–19

    Google Scholar 

  6. — M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simpliefied NP-complete graph problems, Theo. Comput. Sci. 1, 1976, 237–267

    Google Scholar 

  7. — L. Kucera, Parallel computations and conflicts in memory access, Inf. Pro. Letters 14, 1982, 93–96

    Google Scholar 

  8. — Y. Shiloach, U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3, 1982, 57–63

    Google Scholar 

  9. — R.E.Tarjan, U.Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, 25th Annual Symp. of FOCS, 1984, 14–20

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, PKiN VIIIp, 00-901, Warsaw, Poland

    Krzysztof Diks

Authors
  1. Krzysztof Diks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diks, K. (1986). A fast parallel algorithm for six-colouring of planar graphs. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016251

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation