This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232424
If you've NEVER registered a DOI in your Lattes, check our tutorial!In this work we study the Harmonious Graph Coloring Problem (HGCP), an NP-hard variant of graph coloring with strong combinatorial constraints. We propose and evaluate greedy heuristics, a genetic algorithm, and a hybrid biased random-key genetic algorithm (BRKGA) tailored to explore vertex orderings. Computational experiments on random graphs show that evolutionary approaches significantly outperform greedy methods in sparse and bipartite instances, while remaining competitive in denser settings. The results highlight the potential of hybrid metaheuristics for tackling HGCP and open avenues for topology-aware optimization strategies.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper