Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

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

Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring. These methods ...

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

It might not be as bright and shiny as some of the other topics that we've seen here, but there's no denying that the work of Julian Shun and his team is going to be applicable to a lot of the ...