From here graph theory got expanded and generalized into relations between objects, finding use in fields from computer science and chemistry to biology and linguistics.

Algorithm that speeds up comparison of graphs would be first major advance in three decades.

In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee. In an arXiv preprint, researchers from the Kwan Group at the Institute of Science and Technology ...

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

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