Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Optimal parallel 3-colouring algorithm for rooted trees and its application

  • Part III Communications
  • Conference paper
  • First Online:
Aspects and Prospects of Theoretical Computer Science (IMYCS 1990)

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

Included in the following conference series:

  • 123 Accesses

Abstract

A new optimal parallel algorithm for 3-colouring rooted trees with maximum degree Δ is presented. The algorithm runs in O(Δ log n/log log n) time on a CRCW PRAM using O(Δ n log log n/log n) processors. This technique is used to develop optimal algorithms for several graph problems including (Δ+1)-colouring of constant degree graphs, 7-colouring of planar graphs or finding a maximal independent set in a planar graph. The technique can be applied to expression tree evaluation as well and yields an optimal logarithmic time algorithm.

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.

References

  1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick and T. Przytycka, "A simple parallel tree contraction algorithm", J. Algorithms, 10 (1989), pp.287–302.

    Article  Google Scholar 

  2. R. Cole and U. Vishkin, "The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time", Algorithmica, 3 (1988a), pp. 329–346.

    Article  Google Scholar 

  3. R. Cole and U. Vishkin, "Faster optimal parallel prefix sums and list ranking", Inform. and Comput., 81 (1989), pp.334–352.

    Google Scholar 

  4. H. Gazit, G.L. Miller and S.H. Teng, "Optimal tree contraction in an EREW model", in S.K. Tewkesbury, B.W. Dickinson and S.C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture and Technology, Plenum Press, New York, 1988.

    Google Scholar 

  5. A. Gibbons and W. Rytter, "Efficient parallel algorithms", Cambridge University Press, Cambridge, 1988.

    Google Scholar 

  6. A. Gibbons and W. Rytter, "Optimal parallel algorithms for dynamic expression evaluation and context-free recognition", Inform. and Comput., 81 (1989), pp.32–45.

    Google Scholar 

  7. A. V. Goldberg, S. A. Plotkin and G. E. Shannon, "Parallel symmetry — breaking in sparse graphs", SIAM J. Disc. Math., 1 (1988), pp.434–446.

    Google Scholar 

  8. M. Goldberg and T. Spencer, "Constructing a maximal independent set in parallel", SIAM J. Disc. Math., 2 (1989), pp.322–328.

    Google Scholar 

  9. T. Hagerup, "Optimal parallel algorithms on planar graphs", in J.H. Reif, editor, VLSI Algorithms and Architectures, Lecture Notes in Computer Science 319, Springer-Verlag, New York, Berlin, 1988, pp. 24–32.

    Google Scholar 

  10. F. Harary, "Graph theory", Addison Wesley, Reading, Mass., 1969.

    Google Scholar 

  11. S.R. Kosaraju and A.L. Delcher, "Optimal parallel evaluation of tree — structured computations by raking", in J.H. Reif, editor, VLSI Algorithms and Architectures, Lecture Notes in Computer Science, 319, Springer-Verlag, New York, Berlin, 1988, pp.101–110.

    Google Scholar 

  12. M. Luby, "Removing randomness in parallel computation without a processor penalty", in Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, 1988, pp.162–173.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of the Slovak Academy of Sciences, Dúbravská cesta 9, 842 35, Bratislava, Czechoslovakia

    Peter Rajčáni

Authors
  1. Peter Rajčáni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajčáni, P. (1990). Optimal parallel 3-colouring algorithm for rooted trees and its application. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

  • Online ISBN: 978-3-540-46869-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation