Quantum approaches to graph colouring

Quantum inspired cuckoo search algorithm for graph colouring problem

The graph coloring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimization problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph coloring problem using a new approach based on the quantum inspired cuc...

Colouring a Graph Frugally

Evolutionary Graph Colouring

The problem we are addressing in this paper was proposed at SIROCCO’98 by Kranakis [1], with possible applications to finding a consensus in distributive networks. The problem can be viewed as a simple game on graphs, in a way similar to the game of life. The aim is to colour all vertices of a graph, which are initially coloured with three colours 0,1, and 2, with a single colour. The only rule...

Graph colouring algorithms

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.

Application of graph colouring to biological networks.

The author explores the application of graph colouring to biological networks, specifically protein-protein interaction (PPI) networks. First, the author finds that given similar conditions (i.e. graph size, degree distribution and clustering), fewer colours are needed to colour disassortative than assortative networks. Fewer colours create fewer independent sets which in turn imply higher conc...