An undirected graph can demonstrate adjacency relationships among regions in a planar
map, and the four-coloring map problem is then converted into a graph vertex coloring …

Vertex coloring is an assignment of colors to vertex of an undirected graph such that no two
vertices sharing the same edge have the same color. The vertex coloring problem is to find …

Ant colony system (ACS) algorithm is new meta-heuristic for hard combinational optimization
problem. It is a population-based approach that uses exploitation of positive feedback as …

Let G=(V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign
a color (a number chosen in {1,..., k}) to each vertex of V so that no edge has both endpoints …

The Graph Coloring Problem (GCP) is a significant research area in graph theory, and new
breakthroughs are constantly being made, while the ant colony optimization shows its …

In this paper, we propose a new kind of ant algorithm called Ant Local Search. In most ant
algorithms, the role of each ant is to build a solution in a constructive way. In contrast, we …

The goal of a map coloring problem is to color a map so that regions sharing a common
border have different colors, map-coloring problem is a classic NP-complete graph …

In this paper, we present a first ACO approach, namely ant colony system (ACS) for the
graph colouring problem (GCP). We implemented two strategies of ACS for the GCP; …

We present a hybrid chaotic ant swarm approach for the graph coloring problem (CASCOL).
This approach is based on a novel swarm intelligence technique called chaotic ant swarm …

This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring
problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu …