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 ofconstant edge probability used in these models.
Cite
CITATION STYLE
Furer, M., Subramanian, C. R., & Madhavan, C. E. V. (1993). Coloring random graphs in polynomial expected time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 31–37). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_232
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
