Combinatorial problems abound in domains such as scheduling, routing, resource allocation and logical inference. Owing to their typically NP-hard nature, no single algorithm uniformly outperforms all ...

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...