A fresh look at a randomized massively parallel graph coloring algorithm

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

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.

• Jezik: Angleški jezik
• Ključne besede: combinatorial optimization, graph coloring, randomized local search procedure, temperature
• Vrsta gradiva: Članek v reviji
• Tipologija: 1.01 - Izvirni znanstveni članek
• Organizacija: FS - Fakulteta za strojništvo
• Status publikacije: Objavljeno
• Različica publikacije: Objavljena publikacija
• Leto izida: 2024
• Št. strani: Str. 105-117
• Številčenje: Vol. 15, no. 2
• PID: 20.500.12556/RUL-163512
• UDK: 519.17:004.021
• ISSN pri članku: 1848-0225
• DOI: 10.17535/crorr.2024.0009
• COBISS.SI-ID: 210624771
• Datum objave v RUL: 08.10.2024

Gradivo je del revije

• Naslov: Croatian operational research review : CRORR
• Založnik: Croatian Operational Research Society
• ISSN: 1848-0225
• COBISS.SI-ID: 10670108

Sekundarni jezik

• Jezik: Slovenski jezik
• Ključne besede: kombinatorna optimizacija, barvanje grafov, randomizirani lokalni iskalni postopek, temperatura