Service Communautaire d'Information sur la Recherche et le Développement - CORDIS


DSSCV Résumé de rapport

Project ID: IST-2001-35443
Financé au titre de: FP5-IST
Pays: 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
See on map