The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

Quantum walks sound abstract, but they sit at the center of a very concrete race: who will harness quantum mechanics to solve problems that overwhelm today’s most powerful supercomputers. Instead of ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

The travelling salesman problem was mathematically formulated in 1800s by Mathematicians W.R. Hamilton and Thomas Kirkman. Considered as a classic algorithmic problem in the field of operations ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...