Temporal network analysis examines structures in which connections between entities evolve over time. Unlike static graphs, temporal networks encode not only which nodes are connected but also when ...

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

Ming-Yang Kao, professor emeritus of computer science at Northwestern Engineering, passed away on May 11, 2026. He will be remembered for his contributions to the field of theoretical computer science ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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