Skip to main content
SpringerLink
Log in

Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities

  • Conference paper
Mathematical Foundations of Computer Science 2006 (MFCS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4162))

Abstract

Random 3-colorable graphs that are generated according to a G(n,p)-like model can be colored optimally, if p ≥c/n for some large constant c. However, these methods fail in a model where the edge-probabilities are non-uniform and not bounded away from zero. We present a spectral algorithm that succeeds in such situations.

Research supported by DFG under grant Br 2158/2-3.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM Journal on Computing 26, 1733–1748 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brandes, U., Lerner, J.: Structural similarity in graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 184–195. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Johann Ambrosius Barth (1995)

    Google Scholar 

  4. Dyer, M.E., Frieze, A.M.: Fast solution of some random NP-hard problems. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986), pp. 331–336 (1986)

    Google Scholar 

  5. Feige, U., Kilian, J.: Heuristics for semi-random graph problems. Journal of Computer and System Sciences 63(4), 639–671 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman and Company (1979)

    Google Scholar 

  7. Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  8. Golub, G.H., van Loan, C.F.: Matrix Computations. John Hopkins University Press (1996)

    Google Scholar 

  9. Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, Chichester (1995)

    MATH  Google Scholar 

  10. Krivelevich, M.: Coloring random graphs – an algorithmic perspective. In: Proceedings of the 2nd Colloquium on Mathematics and Computer Science (MathInfo 2002), pp. 175–195 (2002)

    Google Scholar 

  11. Kučera, L.: Expected behavior of graph coloring algorithms. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol. 56, pp. 447–451. Springer, Heidelberg (1977)

    Google Scholar 

  12. McSherry, F.: Spectral partitioning of random graphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 529–537 (2001)

    Google Scholar 

  13. Stewart, G.W., Sun, J.-G.: Matrix Perturbation Theory. Academic Press, London (1990)

    MATH  Google Scholar 

  14. Subramanian, C.R., Fürer, M., Madhavan, C.E.V.: Algorithms for coloring semi-random graphs. Random Structures and Algorithms 13, 125–158 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Turner, J.: Almost all k-colorable graphs are easy to color. Journal of Algorithms 9, 63–82 (1988)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer & Information Science, University of Konstanz,  

    Ulrik Brandes & Jürgen Lerner

Authors
  1. Ulrik Brandes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Lerner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 84248, Bratislava, Slovakia

    Rastislav Královič

  2. Institute of Informatics, University of Warsaw, Poland

    Paweł Urzyczyn

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandes, U., Lerner, J. (2006). Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_18

Download citation

  • DOI: https://doi.org/10.1007/11821069_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation