|
|||||
|
|
A passage time for greedy-coloring cycles |
|
| Authors: | J. Preater |
| Abstract: | We consider the progress of the greedy vertex coloring algorithm applied to cycle graphs. In particular we study the asymptotic distribution of the number of vertices colored by the algorithm when the third color is first used (if it is). |
| Keywords: | greedy algorithm coloring saddlepoint approximation Stein-Chen method asymptotic distribution |