Skip to main content
SpringerLink
Log in

Probabilistic analysis of graph colouring algorithms

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

  • 122 Accesses

Abstract

In this paper we analyze algorithms for the graph colouring problem from a probabilistic point of view. Furthermore we show that the chromatic number of a graph converges to n log 1/q / 2 log n almost surely.

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. B. BOLLOBAS, P. ERDÖS: Cliques in random graphs. Math. Proc. Camb. Phil. Soc., vol. 80, (1976).

    Google Scholar 

  2. P. ERDÖS, A. RENYI: On random graphs 1. Publ. Math., vol. 6, (1959).

    Google Scholar 

  3. M.R. GAREY, D.S. JOHNSON: The complexity of near-optimal graph colouring. J. ACM, vol. 33, n. 1, pp. 43–46 (1976).

    Article  Google Scholar 

  4. M.R. GAREY, D.S. JOHNSON: Computers and intractability: a guide to the theory of NP-completeness. Freeman San Francisco (1978).

    Google Scholar 

  5. G.R. GRIMETT, C.J.H. Mc DIARMID: On colouring random graphs. Math. Proc. Camb. Phil. Soc., vol. 77, pp. 313–324, (1975).

    Google Scholar 

  6. R.M. KAPP: The probabilistic analysis of some combinatorial search algorithms. In J.F. Traub (ed.), Algorithms and complexity J.F. Traud, Academic Press (1976).

    Google Scholar 

  7. E.L. LAWLER: A note on the complexity of the chromatic number. Inf. Proc. Let. (1976).

    Google Scholar 

  8. C.J.H. Mc DIARMID: Determining the chromatic number of a graph. SIAM J. on Comp. (1981).

    Google Scholar 

  9. M. TALAMO: Analisi probabilistica della complessità di algoritmi di colorazione. Thesis Università di Roma (1981).

    Google Scholar 

  10. M. TALAMO: A probabilistic of some greedy algorithms. Technical Report R.12 Istituto di Automatica, Università di Roma (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma, Via Eudossiana 18, 00184, Roma, Italia

    A. Marchetti-Spaccamela & M. Talamo

Authors
  1. A. Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marchetti-Spaccamela, A., Talamo, M. (1983). Probabilistic analysis of graph colouring algorithms. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation