Skip to main content

Distributed and Dynamic Graph Algorithms and Complexity

Objective

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.

Call for proposal

ERC-2016-STG
See other projects for this call

Funding Scheme

ERC-STG - Starting Grant

Host institution

KUNGLIGA TEKNISKA HOEGSKOLAN
Address
Brinellvagen 8
100 44 Stockholm
Sweden
Activity type
Higher or Secondary Education Establishments
EU contribution
€ 1 500 000

Beneficiaries (1)

KUNGLIGA TEKNISKA HOEGSKOLAN
Sweden
EU contribution
€ 1 500 000
Address
Brinellvagen 8
100 44 Stockholm
Activity type
Higher or Secondary Education Establishments