Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1993: Algorithms and Computation pp 31–37Cite as

Coloring random graphs in polynomial expected time

  • Conference paper
  • First Online:

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

Abstract

We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption of constant edge probability used in these models.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Blum, Some Tools for Approximate 3-Coloring, FOCS, 1990, 554–562.

    Google Scholar 

  2. A. Blum and J. Spencer, Coloring Random and Semi-Random k-Colorable Graphs, Submitted to Journal of Algorithms.

    Google Scholar 

  3. M.E. Dyer and A.M. Frieze, The solution of Some Random NP-Hard Problems in Polynomial Expected Time, J. Alg., 10, 1989, 451–489.

    Google Scholar 

  4. M.Furer and C.R. Subramanian, Coloring Random Graphs, SWAT,1992.

    Google Scholar 

  5. C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems, Proc. of Worshop on Approx. Algos. New Delhi, Dec 1992.

    Google Scholar 

  6. J.S. Turner, Almost All k-colorable Graphs are Easy to Color, J. Alg., 9, 1988, 63–82.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, 16801, State College, PA, USA

    Martin Furer

  2. Dept. of Computer Science and Automation, Indian Institute of Science, 560 012, Bangalore, India

    C. R. Subramanian & C. E. Veni Madhavan

Authors
  1. Martin Furer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. R. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. E. Veni Madhavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furer, M., Subramanian, C.R., Veni Madhavan, C.E. (1993). Coloring random graphs in polynomial expected time. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_232

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_232

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation