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

DISTRUCT

Financiado

Cerrado

Structure Theory for Directed Graphs

Structural graph theory has proved to be a powerful tool for coping with computational intractability. It provides a wealth of concepts and results that can be used to design efficient algorithms for hard computational problems o... ver más

30/06/2021

TUB

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

TECHNISCHE UNIVERSITAT BERLIN 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 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2021-06-30

ERC-CoG-2014: ERC Consolidator Grant

I+D

Cerrada hace 10 años

0% 100% 100%

Información adicional privada

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

2 Participantes

TUB

1.83M€ | Lider

ATLANTICA DE HANDLING

Proyectos interesantes

SYSTEMATICGRAPH

Software

Data Science

2M€ Cerrado

BOBR

Software

Data Science

1M€ Cerrado

PARAMTIGHT

Software

Data Science

1M€ Cerrado

BUKA

Software

Data Science

2M€ Cerrado

DisDyn

Software

Data Science

2M€ Cerrado

TIPEA

Software

Data Science

1M€ Cerrado

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

Duración del proyecto: 74 meses Fecha Inicio: 2015-04-07
Fecha Fin: 2021-06-30

Líder del proyecto

TECHNISCHE UNIVERSITAT BERLIN 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 Structural graph theory has proved to be a powerful tool for coping with computational intractability. It provides a wealth of concepts and results that can be used to design efficient algorithms for hard computational problems on specific classes of graphs that occur naturally in applications. In many applications in computer science, the natural mathematical model are directed graphs. Unfortunately, research in structural graph theory has so far almost exclusively focussed on undirected graphs and no structure theory for directed graphs comparable to the tree-width and graph minors based approach for undirected graphs has been developed that would provide for a similar set of tools and concepts to deal with computational problems on directed graphs. The objective of this proposal is to develop such a structure theory aimed specifically at algorithmic applications on directed graphs. The novelty of our approach is that a) it is based on directed minors which allows us to avoid the algorithmic problems faced by existing digraph width measures and has not been studied before in this context and b) it facilitates our recent proof of the excluded directed grid theorem which is likely to allow entirely new algorithmic techniques for directed graphs. The focus of the project is on the development of the structural foundations and algorithmic techniques for designing efficient algorithms for a wide range of algorithmic digraph problems. In particular, we will use an approach based on logical definability for developing such algorithmic techniques. Furthermore, we will apply our methods to two specific application areas, model-checking in computer-aided verification and inference problems in Bayesian networks.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores