Servicio de Información Comunitario sobre Investigación y Desarrollo - CORDIS

FP5

DSSCV Informe resumido

Project ID: IST-2001-35443
Financiado con arreglo a: FP5-IST
País: Denmark

The tree inclusion problem: In optimal space and faster

We have studied combinatorial tree matching problems primarily focusing on problems based on local transitions or edit operations in the tree. These types of problems are suitable for MSST matching since transitions in the underlying images naturally correspond to transitions in the trees. The key contributions of the work are a number of papers, including a comprehensive survey of tree matching problems and two theoretical papers studying two specific tree-matching problems. The latter two papers present new algorithms significantly improving the previously known complexity bounds.

Reported by

IT-Universitetet i Kobenhavn
Rued Langgaards Vej 7
2300 Copenhagen S
Denmark
See on map
Síganos en: RSS Facebook Twitter YouTube Gestionado por la Oficina de Publicaciones de la UE Arriba