A randomized algorithm for \(k\)-colorability
type: Item
instance of: scholarly article
title: A randomized algorithm for \(k\)-colorability
zbMATH Open document ID: 0805.05029
DOI: 10.1016/0012-365X(94)90402-2
author: Janez Žerovnik
published in: Discrete Mathematics
publication date: 1995-01-26T00:00:00Z
review text: The author tests a straightforward generalization of \textit{A. D. Petford} and \textit{D. J. A. Welsh} [A randomized 3-colouring algorithm, Discrete Math. 74, No. 1/2, 253-261 (1989; Zbl 0667.05025)] on randomly generated samples of 4- and 10-colourable graphs, and he conjectures that the curious critical regions found in the case of 3-colourings are a general phenomena for all \(k\).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 626327
zbMATH Keywords: randomized algorithm
zbMATH Keywords: colouring
zbMATH Keywords: critical regions
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
cites work: Optimization by Simulated Annealing
cites work: A randomised 3-colouring algorithm
cites work: Almost all k-colorable graphs are easy to color
cites work: A randomised heuristical algorithm for estimating the chromatic number of a graph
cites work: A parallel variant of a heuristical algorithm for graph colouring
cites work: A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
full work available at URL: 0012-365x(94)90402-2
OpenAlex ID: W2159322473
description: scientific article; zbMATH DE number 626327