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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Croatian Operational Research Review Ročník 15; číslo 2; s. 105 - 117
Hlavní autori: Žerovnik, Janez, Gabrovšek, Boštjan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Zagreb Croatian Operational Research Society (CRORS) 2024
Croatian Operational Research Society
Predmet:
Algorithms
combinatorial optimization
Experiments
Graph coloring
Heuristic methods
Phase transitions
Physics
Probability distribution
randomized local search procedure
Statistical mechanics
temperature
Theoretical physics
ISSN:1848-9931, 1848-0225, 1848-9931
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1848-9931
1848-0225
1848-9931
DOI:10.17535/crorr.2024.0009