Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

SYSTEMATICGRAPH

Financiado

Cerrado

Systematic mapping of the complexity landscape of hard algorithmic graph problem...

Systematic mapping of the complexity landscape of hard algorithmic graph problems Graph-theoretical models are natural tools for the description of road networks, circuits, communication networks, and abstract relations between objects, hence algorithmic graph problems appear in a wide range of computer science... ver más

31/12/2022

CISPA HELMHOLTZZE...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

CISPA HELMHOLTZZENTRUM FUR INFORMATIONSSICHE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Ver 3 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2022-12-31

ERC-2016-COG: ERC Consolidator Grant

I+D

Cerrada hace 8 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

3 Participantes

CISPA HELMHOLTZZENTRUM FUR...

1.00M€ | Lider

HUN-REN SZTAKI

359.09K€ | Participante

MPG

170.00K€ | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

DISTRUCT Structure Theory for Directed Graphs 2M€ Cerrado

PARAMTIGHT Parameterized complexity and the search for tight complexity... 1M€ Cerrado

DisDyn Distributed and Dynamic Graph Algorithms and Complexity 2M€ Cerrado

BOBR Decomposition methods for discrete problems 1M€ Cerrado

TOTAL Technology transfer between modern algorithmic paradigms 1M€ Cerrado

BUKA Limits of Structural Tractability 2M€ Cerrado

Duración del proyecto: 71 meses Fecha Inicio: 2017-01-24
Fecha Fin: 2022-12-31

Líder del proyecto

CISPA HELMHOLTZZENTRUM FUR INFORMATIONSSICHE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Graph-theoretical models are natural tools for the description of road networks, circuits, communication networks, and abstract relations between objects, hence algorithmic graph problems appear in a wide range of computer science applications. As most of these problems are computationally hard in their full generality, research in graph algorithms, approximability, and parameterized complexity usually aims at identifying restricted variants and special cases, which are at the same time sufficiently general to be of practical relevance and sufficiently restricted to admit efficient algorithmic solutions. The goal of the project is to put the search for tractable algorithmic graph problems into a systematic and methodological framework: instead of focusing on specific sporadic problems, we intend to obtain a unified algorithmic understanding by mapping the entire complexity landscape of a particular problem domain. Completely classifying the complexity of each and every algorithmic problem appearing in a given formal framework would necessarily reveal every possible algorithmic insight relevant to the formal setting, with the potential of discovering novel algorithmic techniques of practical interest. This approach has been enormously successful in the complexity classifications of Constraint Satisfaction Problems (CSPs), but comparatively very little work has been done in the context of graphs. The systematic investigation of hard algorithmic graph problems deserves the same level of attention as the dichotomy program of CSPs, and graph problems have similarly rich complexity landscapes and unification results waiting to be discovered. The project will demonstrate that such a complete classification is feasible for a wide range of graph problems coming from areas such as finding patterns, routing, and survivable network design, and novel algorithmic results and new levels of algorithmic understanding can be achieved even for classic and well-studied problems.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores