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

The Black and White Coloring (BWC) problem is initially described in 1. There is an undirected graph G = (V, E), where V is a set containing n vertices, and E is a set containing l edges. The vertices ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...