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...
| Main Authors: | , , |
|---|---|
| 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 |