Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O (|T1| x |T2| x (degT1 + deg T2) x log2 (deg T1 + deg T2)).
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article biblioteca |
| Language: | eng |
| Subjects: | U30 - Méthodes de recherche, U10 - Informatique, mathématiques et statistiques, K10 - Production forestière, cartographie, arbre, espacement, modèle mathématique, modèle de simulation, http://aims.fao.org/aos/agrovoc/c_1344, http://aims.fao.org/aos/agrovoc/c_7887, http://aims.fao.org/aos/agrovoc/c_7272, http://aims.fao.org/aos/agrovoc/c_24199, http://aims.fao.org/aos/agrovoc/c_24242, |
| Online Access: | http://agritrop.cirad.fr/523923/ http://agritrop.cirad.fr/523923/1/523923.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|