Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective

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

Finally, a Fast Algorithm for Shortest Paths on Negative Graphs

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

graph theory

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

Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
Wired

How Big Data Carried Graph Theory Into New Dimensions

All products featured on WIRED are independently selected by our editors. However, we may receive compensation from retailers and/or from purchases of products through these links. Learn more. Graph ...
Quanta Magazine

Graph theory

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” The Quanta Newsletter ...