Skip to main content
Ir a la página de inicio de la Comisión Europea (se abrirá en una nueva ventana)
español es
CORDIS - Resultados de investigaciones de la UE
CORDIS

Distributed and Dynamic Graph Algorithms and Complexity

Objetivo

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.

Ámbito científico (EuroSciVoc)

Palabras clave

Programa(s)

Tema(s)

Régimen de financiación

ERC-STG - Starting Grant

Ver todos los proyectos financiados en el marco de este régimen de financiación

Convocatoria de propuestas

(se abrirá en una nueva ventana) ERC-2016-STG

Ver todos los proyectos financiados en el marco de esta convocatoria

Institución de acogida

KOBENHAVNS UNIVERSITET
Aportación neta de la UEn
€ 237 788,75
Dirección
NORREGADE 10
1165 KOBENHAVN
Dinamarca
Región
Danmark Hovedstaden Byen København
Tipo de actividad
Higher or Secondary Education Establishments
Enlaces
Coste total
€ 237 788,75

Beneficiarios (2)