A fresh look at a randomized massively parallel graph coloring algorithmGabrovšek, Boštjan (Avtor) Žerovnik, Janez (Avtor) combinatorial optimizationgraph coloringrandomized local search proceduretemperaturePetford and Welsh introduced a sequential heuristic algorithm to provide an approximate solution to the NP-hard graph coloring problem. The algorithm is based on the antivoter model and mimics the behavior of a physical process based on a multi-particle system of statistical mechanics. It was later shown that the algorithm can be implemented in a massively parallel model of computation. The increase in computational processing power in recent years allows us to perform an extensive analysis of the algorithms on a larger scale, leading to the possibility of a more comprehensive understanding of the behavior of the algorithm, including the phase transition phenomena.20242024-10-08 10:44:03Članek v reviji163512UDK: 519.17:004.021ISSN pri članku: 1848-0225DOI: 10.17535/crorr.2024.0009COBISS_ID: 210624771sl