ERC Starting Grant · 2021
Towards a New Theory of Optimal Dynamic Graph Algorithms
Dynamic graph algorithms are of increasing critical importance. They are crucial for coping with dynamic networks, which model the ever-changing physical world, and have been instrumental in achieving numerous major breakthroughs in static graph algorithms. The holy grail in the field of dynamic graph algorithms has been to design algorithms with poly-logarithmic (in the input size) update time. However, recent exciting developments, in which the PI has played a central role, aim to push the update time toward an absolute constant independent of the input size – which is qualitatively very different than a poly-log bound. This goal is of fundamental importance not just from a theoretical…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.