The ETH Zurich researchers have since refined their approach and developed further almost-linear-time algorithms. For example, the first algorithm was still focused on fixed, static networks whose ...

On Thursday, Simon Meierhans—a member of Kyng's team— presented a new almost-linear-time algorithm at the Annual ACM Symposium on Theory of Computing (STOC 2024) in Vancouver.