A new algorithm efficiently solves the graph isomorphism problem, computer scientist László Babai announced November 10 at a Combinatorics and Theoretical Computer Science seminar at the ...

Nelson asked: What is the smallest number of colors that you’d need to color any such graph, even one formed by linking an infinite number of vertices? The problem, now known as the Hadwiger-Nelson ...

Identity management for cybersecurity is inherently a complex graph problem due to the vast, dynamic, and interconnected nature of modern IT environments. [Images: Media Masterpieces / Adobe Stock ...

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

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

This looks a lot like Facebook’s Graph Search promise. Except for one major problem: privacy. If you want to find the most interesting experts on a topic, would you limit your search to friends?

Using spectral graph theory, mathematicians have solved a decades-old problem. Graph theory uses nodes and edges (dots and lines) to represent data. If you’ve ever drooled over a cherry pie ...