Abstract
Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that either solve the problem in most but not all cases, but are of polynomial time complexity, or that give a correct solution on all input graphs while guaranteeing a polynomial running time on average only. An algorithm of the first kind was suggested by Alon and Kahale in [1] for the following type of random k-colorable graphs: Construct a graph \(\mathcal{G}_{n,p,k}\) on vertex set V of cardinality n by first partitioning V into k equally sized sets and then adding each edge between these sets with probability p independently from each other. Alon and Kahale showed that graphs from \(\mathcal{G}_{n,p,k}\) can be k-colored in polynomial time with high probability as long as p ≥ c/n for some sufficiently large constant c. In this paper, we construct an algorithm with polynomial expected running time for k = 3 on the same type of graphs and for the same range of p. To obtain this result we modify the ideas developed by Alon and Kahale and combine them with techniques from semidefinite programming. The calculations carry over to general k.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM Journal on Computing 26(6), 1733–1748 (1997)
Coja-Oghlan, A.: Coloring semirandom graphs optimally. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp. 383–395 (2004)
Coja-Oghlan, A., Moore, C., Sanwalani, V.: MAX k-CUT and approximating the chromatic number of random graphs. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pp. 200–211 (2003)
Dyer, M.E., Frieze, A.M.: The solution of some random NP-hard problems in polynomial expected time. Journal of Algorithms 10, 451–489 (1989)
Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Journal of Computer and System Sciences 57(2), 187–199 (1998)
Frieze, A.M., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 61–77 (1997)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1993)
Khanna, S., Linial, N., Safra, S.: On the hardness of approximating the chromatic number. Combinatorica 20(3), 393–415 (2000)
Krivelevich, M.: Deciding k-colorability in expected polynomial time. Information Processing Letters 81, 1–6 (2002)
Kučera, L.: Expected behavior of graph colouring algorithms. In: Proceedings of the 1977 International Conference on Fundamentals of Computation Theory, pp. 447–451 (1977)
Subramanian, C.R.: Algorithms for coloring random k-colorable graphs. Combinatorics, Probability and Computing 9, 45–77 (2000)
Turner, J.S.: Almost all k-colorable graphs are easy to color. Journal of Algorithms 9, 253–261 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böttcher, J. (2005). Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_15
Download citation
DOI: https://doi.org/10.1007/11549345_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)