A fuzzy irregular cellular automata-based method for the vertex colouring problem. Issue 1 (2nd January 2020)

• Record Type: Journal Article
• Authors: Kashani, Mostafa; Gorgin, Saeid; Shojaedini, Seyed Vahab
• Is Part Of: Connection science. Volume 32:Issue 1(2020)
• Page Start: 37
• Page End: 52
• Publication Date: 2020-01-02
• Subjects: Graph colouring -- vertex colouring problem -- fuzzy irregular cellular automata; Neural computers -- Periodicals; Artificial intelligence -- Periodicals; Cognitive science -- Periodicals; Connectionism -- Periodicals; 006.3
• DOI: 10.1080/09540091.2019.1650329
• Languages: English
• ISSNs: 0954-0091

Abstract

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