Elsevier

Discrete Mathematics

Volume 131, Issues 1–3, 5 August 1994, Pages 379-393
Discrete Mathematics

Note
A randomized algorithm for k-colorability

https://doi.org/10.1016/0012-365X(94)90402-2Get rights and content
Under an Elsevier user license
open archive

Abstract

This note is a report of testing a straightforward generalization of the randomized 3-coloring algorithm of Petford and Welsh (1989) on the decision problems of 4- and 10-coloring. We observe similar behavior, namely the existence of critical regions. Experimentally, the average time complexity for large n again seems to grow slowly, although in some cases the number of transitions needed is prohibitively high for practical applications.

Keywords

Graph coloring
Randomized algorithm
Critical region

Cited by (0)

1

On leave from Inštitut Jožef Stefan, Ljubljan, Slovenia. Current address: Tehniška fakulteta Univerza v Mariboru, Smetanova 17, 62000 Maribor, Slovenia.