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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2024-01-01
|
| Series: | Croatian Operational Research Review |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/464223 |