New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...

Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...

Graph optimisation problems encompass a diverse range of challenges aimed at finding optimal or near‐optimal solutions in networks or graphs. These problems are pivotal in areas such as communication ...

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

Vector maximization problems arise when more than one objective function is to be maximized over a given feasibility region. While the concept of efficiency has played a useful role in the analysis of ...

The Mathematical Gazette is the original journal of the Mathematical Association and it is now over a century old. Its readership is a mixture of school teachers, college and university lecturers, ...