A fresh look at a randomized massively parallel graph coloring algorithm

Gabrovšek, Boštjan (author), Žerovnik, Janez (author)

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.

• Language: English
• Keywords: combinatorial optimization, graph coloring, randomized local search procedure, temperature
• Work type: Article
• Typology: 1.01 - Original Scientific Article
• Organization: FS - Faculty of Mechanical Engineering
• Publication status: Published
• Publication version: Version of Record
• Year: 2024
• Number of pages: Str. 105-117
• Numbering: Vol. 15, no. 2
• PID: 20.500.12556/RUL-163512
• UDC: 519.17:004.021
• ISSN on article: 1848-0225
• DOI: 10.17535/crorr.2024.0009
• COBISS.SI-ID: 210624771
• Publication date in RUL: 08.10.2024

Record is a part of a journal

• Title: Croatian operational research review : CRORR
• Publisher: Croatian Operational Research Society
• ISSN: 1848-0225
• COBISS.SI-ID: 10670108

Secondary language

• Language: Slovenian
• Keywords: kombinatorna optimizacija, barvanje grafov, randomizirani lokalni iskalni postopek, temperatura