20.500.12556/RUL-163512 A fresh look at a randomized massively parallel graph coloring algorithm Petford 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. combinatorial optimization graph coloring randomized local search procedure temperature kombinatorna optimizacija barvanje grafov randomizirani lokalni iskalni postopek temperatura true false true Angleški jezik Slovenski jezik Članek v reviji 2024-10-08 10:44:03 2024-10-08 10:44:08 2025-03-20 11:03:44 0000-00-00 00:00:00 2024 0 0 Str. 105-117 no. 2 Vol. 15 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17:004.021 1848-0225 10.17535/crorr.2024.0009 210624771 Gabrovsek,_Zerovnik_-_A_fresh_look_at_a_randomized.pdf Gabrovsek,_Zerovnik_-_A_fresh_look_at_a_randomized.pdf 1 EDB17C7BFCAA859FA5D7E8D77EBCDD31 f3f6fff36a3234fcabf058a62b93f9acba7b1cda169ae67fc356f96e9ade39f8 d03e127d-8551-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=193257 https://hrcak.srce.hr/ojs/index.php/crorr/article/view/29342 1 4f32dbb1-8551-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=193255 Fakulteta za strojništvo 0 0 0