A fuzzy irregular cellular automata-based method for the vertex colouring problem

Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way that no two adjacent vertices have the same c...

Full description

Bibliographic Details
Main Authors: Mostafa Kashani, Saeid Gorgin, Seyed Vahab Shojaedini
Format: Article
Language:English
Published: Taylor & Francis Group 2020-01-01
Series:Connection Science
Subjects:
Online Access:http://dx.doi.org/10.1080/09540091.2019.1650329
_version_ 1797684078888091648
author Mostafa Kashani
Saeid Gorgin
Seyed Vahab Shojaedini
author_facet Mostafa Kashani
Saeid Gorgin
Seyed Vahab Shojaedini
author_sort Mostafa Kashani
collection DOAJ
description Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way that no two adjacent vertices have the same colour. This paper presents a fuzzy irregular cellular automaton (FICA) for finding a near-optimal solution for the VCP. FICA is an extension fuzzy cellular automaton (FCA) in which the cells of the automaton can be arranged in an irregular structure. The aim of the proposed method is to reap the benefits of both FCA and irregular cellular automata while minimising their drawbacks. To evaluate the proposed method, various computer simulations have been conducted on a variety of graphs. The results suggest that the proposed method is able to achieve better results in terms of the minimum number of required colours and the execution time of the algorithm, compared to other peer algorithms.
first_indexed 2024-03-12T00:24:23Z
format Article
id doaj.art-879ff90dbe1e4b8199c048e7691d20ac
institution Directory Open Access Journal
issn 0954-0091
1360-0494
language English
last_indexed 2024-03-12T00:24:23Z
publishDate 2020-01-01
publisher Taylor & Francis Group
record_format Article
series Connection Science
spelling doaj.art-879ff90dbe1e4b8199c048e7691d20ac2023-09-15T10:47:58ZengTaylor & Francis GroupConnection Science0954-00911360-04942020-01-01321375210.1080/09540091.2019.16503291650329A fuzzy irregular cellular automata-based method for the vertex colouring problemMostafa Kashani0Saeid Gorgin1Seyed Vahab Shojaedini2Iranian Research Organization for Science and Technology (IROST)Iranian Research Organization for Science and Technology (IROST)Iranian Research Organization for Science and Technology (IROST)Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way that no two adjacent vertices have the same colour. This paper presents a fuzzy irregular cellular automaton (FICA) for finding a near-optimal solution for the VCP. FICA is an extension fuzzy cellular automaton (FCA) in which the cells of the automaton can be arranged in an irregular structure. The aim of the proposed method is to reap the benefits of both FCA and irregular cellular automata while minimising their drawbacks. To evaluate the proposed method, various computer simulations have been conducted on a variety of graphs. The results suggest that the proposed method is able to achieve better results in terms of the minimum number of required colours and the execution time of the algorithm, compared to other peer algorithms.http://dx.doi.org/10.1080/09540091.2019.1650329graph colouringvertex colouring problemfuzzy irregular cellular automata
spellingShingle Mostafa Kashani
Saeid Gorgin
Seyed Vahab Shojaedini
A fuzzy irregular cellular automata-based method for the vertex colouring problem
Connection Science
graph colouring
vertex colouring problem
fuzzy irregular cellular automata
title A fuzzy irregular cellular automata-based method for the vertex colouring problem
title_full A fuzzy irregular cellular automata-based method for the vertex colouring problem
title_fullStr A fuzzy irregular cellular automata-based method for the vertex colouring problem
title_full_unstemmed A fuzzy irregular cellular automata-based method for the vertex colouring problem
title_short A fuzzy irregular cellular automata-based method for the vertex colouring problem
title_sort fuzzy irregular cellular automata based method for the vertex colouring problem
topic graph colouring
vertex colouring problem
fuzzy irregular cellular automata
url http://dx.doi.org/10.1080/09540091.2019.1650329
work_keys_str_mv AT mostafakashani afuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem
AT saeidgorgin afuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem
AT seyedvahabshojaedini afuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem
AT mostafakashani fuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem
AT saeidgorgin fuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem
AT seyedvahabshojaedini fuzzyirregularcellularautomatabasedmethodforthevertexcolouringproblem