To probe an unexplored space of hard problems, researchers play the devil's advocate
In computer science, the graph coloring problem is a classic. Inspired by the map-coloring problem, it asks: Given a network of nodes connected by links, what's the minimum number of colors you need to color each node so ...