@inproceedings{654d810800844d5aa288e16e9b20edb7,

title = "Coloring random graphs in polynomial expected time",

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.",

author = "Martin Furer and Subramanian, {C. R.} and Madhavan, {C. E.Veni}",

year = "1993",

doi = "10.1007/3-540-57568-5_232",

language = "English (US)",

isbn = "9783540575689",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "31--37",

editor = "Ng, {Kam Wing} and Prabhakar Raghavan and N.V. Balasubramanian and Chin, {Francis Y.L.}",

booktitle = "Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings",

address = "Germany",

note = "4th International Symposium on Algorithms and Computation, ISAAC 1993 ; Conference date: 15-12-1993 Through 17-12-1993",

}