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

SymSim

Financiado

Symmetry and Similarity

The goal of this project is to develop an algorithmic theory of similarity between graphs. Graphs are versatile models for representing complex data ranging from chemical molecules to social interactions. Dealing with graphical da... ver más

30/09/2027

RWTH AACHEN

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

RHEINISCHWESTFAELISCHE TECHNISCHE HOCHSCHULE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-05-30

ERC-2021-ADG: ERC ADVANCED GRANTS Scope:Objectives

I+D

Cerrada hace 3 años

0% 100% 100%

1 Participantes

RWTH AACHEN

2.50M€ | Lider

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

RTI2018-096223-B-I00 RECONOCIMIENTO ESTRUCTURAL DE PATRONES CON TEORIA DE LA INFO... 55K€ Cerrado

EXPROTEA Exploring Relations in Structured Data with Functional Maps 1M€ Cerrado

TIN2013-47137-C2-2-P SIMULACION, MODELADO AVANZADO Y ANALISIS VISUAL INTERACTIVO... 38K€ Cerrado

BES-2011-049145 MINERIA DE DATOS CON MODELOS GRAFICOS PROBABILISTICOS: NUEVO... 43K€ Cerrado

TIN2010-20900-C04-04 MINERIA DE DATOS CON PGMS: NUEVOS ALGORITMOS Y APLICACIONES.... 70K€ Cerrado

TIN2011-27479-C04-04 MINERIA EN DATOS BIOLOGICOS Y SOCIALES: ALGORITMOS, TEORIA E... 18K€ Cerrado

Duración del proyecto: 64 meses Fecha Inicio: 2022-05-30
Fecha Fin: 2027-09-30

Líder del proyecto

RHEINISCHWESTFAELISCHE TECHNISCHE HOCHSCHULE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Descripción del proyecto The goal of this project is to develop an algorithmic theory of similarity between graphs. Graphs are versatile models for representing complex data ranging from chemical molecules to social interactions. Dealing with graphical data and enabling modern data analysis techniques, a fundamental task is to compare graphs and to measure their similarity, preferably in a semantically meaningful and algorithmically efficient way. However, it is not clear at all how to achieve this. In many application areas, for example, computer vision, database systems, and formal verification, researchers have proposed (often ad-hoc) solutions to this problem tailored for the specific application, but a general theory is missing. We will develop such a theory in this project. Similarity of graphs has many different facets. We will identify the common core of different approaches to similarity, but also exhibit their differences. We will design methods for comparing different similarity measures and for obtaining a semantic understanding of similarity. We will develop criteria for the suitability of various similarity measures for different types of applications. A particular focus of our research will be on efficient algorithms for computing similarity. There is little use in having a perfect similarity measure if we have no efficient way of determining how similar two graphs are. A classic algorithmic problem in this context is the graph isomorphism problem of deciding whether two graphs are structurally identical. Determining the precise computational complexity of this problem, or of the equivalent problem of computing all symmetries of a graph, is regarded to be one of the most important open questions in theoretical computer science. Building on recent progress, we will design new algorithms breaking barriers towards a polynomial-time algorithm for the isomorphism problem.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores