Quantitative Improvement Old Bound (Dijkstra): O (m+nlog⁡n)O (m+nlogn) New Bound: O (mlog⁡2/3n)O (mlog2/3n) For sparse graphs where mm is about O (n)O (n), this is asymptotically faster as nn grows.

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

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