Fireworks Algorithm for Graph Coloring

Raouan El Ghazi, Lamia Benameur, Alami Chentoufi Jihane

2021

Abstract

The graph-coloring problem has a long and illustrious history, and it is one of the most famous problems in the field of graph theory which consists of determining the minimum number necessary to color the vertices of any graph such that no two adjacent vertices have the same color. In this context, a set of metaheuristics are proposed to restrict the search for a solution. In this study, a new swarm intelligence optimization algorithm called fireworks algorithm FWA will be applied to graph coloring problems to speed up the optimization process, reduce the time, and improve overall performance.

Paper Citation

in Harvard Style

El Ghazi R., Benameur L. and Chentoufi Jihane A. (2021). Fireworks Algorithm for Graph Coloring. In Proceedings of the 2nd International Conference on Big Data, Modelling and Machine Learning - Volume 1: BML, ISBN 978-989-758-559-3, pages 366-370. DOI: 10.5220/0010734500003101

in Bibtex Style

@conference{bml21,
author={Raouan El Ghazi and Lamia Benameur and Alami Chentoufi Jihane},
title={Fireworks Algorithm for Graph Coloring},
booktitle={Proceedings of the 2nd International Conference on Big Data, Modelling and Machine Learning - Volume 1: BML,},
year={2021},
pages={366-370},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010734500003101},
isbn={978-989-758-559-3},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 2nd International Conference on Big Data, Modelling and Machine Learning - Volume 1: BML,
TI - Fireworks Algorithm for Graph Coloring
SN - 978-989-758-559-3
AU - El Ghazi R.
AU - Benameur L.
AU - Chentoufi Jihane A.
PY - 2021
SP - 366
EP - 370
DO - 10.5220/0010734500003101