A randomised 3-colouring algorithm (Q1117242): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite particle systems and infection models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring problems on dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomised algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026025 / rank
 
Normal rank

Revision as of 13:30, 19 June 2024

scientific article
Language Label Description Also known as
English
A randomised 3-colouring algorithm
scientific article

    Statements

    A randomised 3-colouring algorithm (English)
    0 references
    0 references
    0 references
    1989
    0 references
    Trying to extend the voter and antivoter model used to 2-color a graph, the authors introduce a randomised algorithm to 3-color a graph. Simulation results are reported.
    0 references
    3-coloring
    0 references
    threshold function
    0 references
    randomised algorithm
    0 references

    Identifiers