A randomized algorithm for \(k\)-colorability (Q1331989): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A randomised 3-colouring algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Almost all k-colorable graphs are easy to color / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A randomised heuristical algorithm for estimating the chromatic number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel variant of a heuristical algorithm for graph colouring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel variant of a heuristical algorithm for graph coloring -- corrigendum / rank | |||
Normal rank | |||
Revision as of 17:32, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized algorithm for \(k\)-colorability |
scientific article |
Statements
A randomized algorithm for \(k\)-colorability (English)
0 references
26 January 1995
0 references
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\).
0 references
randomized algorithm
0 references
colouring
0 references
critical regions
0 references
