Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Towards a New Theory of Optimal Dynamic Graph Algorithms

Project description

Dynamic graph algorithms under study

Dynamic graph algorithms are crucial for coping with dynamic networks, which model the increasingly changing physical world. The holy grail in the field has been to design algorithms with poly-logarithmic update time. Recent research studies have sought to push the update time towards an absolute constant independent of the input size – which is qualitatively very different than a poly-log bound. The EU-funded DynOpt project will investigate which graph problems admit intrinsically optimal update time. The study will also focus on provably optimal algorithms. Project results have the potential to revolutionise the field of dynamic graph algorithms, and impacting other fields, thus enriching the general landscape of computer science.

Objective

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 perspective, but also from a practical viewpoint, due to the rapidly growing size of modern networks.
An algorithm is intrinsically optimal if its update time matches the ratio of the problems static time complexity to the input size. The main question underlying this research is:
Which graph problems admit intrinsically optimal update time?
Only few intrinsically optimal graph algorithms are known. The unique goal of this project is to establish a systematic study of intrinsically optimal algorithms. We will also study provably optimal algorithms, aiming to advance our understanding of the thin line that separates these two distinct optimality notions. To achieve this goal, we must go far beyond the current state-of-the-art, and in particular, confront some of the most central problems in the field. Meeting the projects main goal, even partially, will be groundbreaking. Results of this project will facilitate the use of dynamic algorithms in real-world application domains, and will also be illuminating to other fields, such as distributed computing and fine-grained complexity.
Consequently, we believe this research has the potential of revolutionizing the field of dynamic graph algorithms, and impacting related fields, thus enriching the general landscape of computer science.

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2021-STG

See all projects funded under this call

Host institution

TEL AVIV UNIVERSITY
Net EU contribution
€ 1 400 000,00
Total cost
€ 1 400 000,00

Beneficiaries (1)