Skip to main content
Przejdź do strony domowej Komisji Europejskiej (odnośnik otworzy się w nowym oknie)
polski pl
CORDIS - Wyniki badań wspieranych przez UE
CORDIS

Distributed and Dynamic Graph Algorithms and Complexity

Cel

This project aims to (i) resolve challenging graph problems in distributed and dynamic settings, with a focus on connectivity problems (such as computing edge connectivity and distances), and (ii) on the way develop a systematic approach to attack problems in these settings, by thoroughly exploring relevant algorithmic and complexity-theoretic landscapes. Tasks include


- building a hierarchy of intermediate computational models so that designing algorithms and proving lower bounds can be done in several intermediate steps,

- explaining the limits of algorithms by proving conditional lower bounds based on old and new reasonable conjectures, and

- connecting techniques in the two settings to generate new insights that are unlikely to emerge from the isolated viewpoint of a single field.


The project will take advantage from and contribute to the developments in many young fields in theoretical computer science, such as fine-grained complexity and sublinear algorithms. Resolving one of the connectivity problems will already be a groundbreaking result. However, given the approach, it is likely that one breakthrough will lead to many others.

Dziedzina nauki (EuroSciVoc)

Słowa kluczowe

Program(-y)

Temat(-y)

System finansowania

ERC-STG - Starting Grant

Wyświetl wszystkie projekty finansowane w ramach tego programu finansowania

Zaproszenie do składania wniosków

(odnośnik otworzy się w nowym oknie) ERC-2016-STG

Wyświetl wszystkie projekty finansowane w ramach tego zaproszenia

Instytucja przyjmująca

KOBENHAVNS UNIVERSITET
Wkład UE netto
€ 237 788,75
Koszt całkowity
€ 237 788,75

Beneficjenci (2)