Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
2003
Ferraro, Pascal | Godin, Christophe
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)). (Résumé d'auteur)
Показать больше [+] Меньше [-]Ключевые слова АГРОВОК
Библиографическая информация
Язык
Английский
Лицензия
Journal Articleinfo:eu-repo/semantics/closedAccess
Тип
Journal Article; Journal Article; Journal Part
Источник
Godin, ChristopheJournal of Algorithms
2019-03-15
AGRIS AP
Поставщик данных
Ссылки
If you notice any incorrect information relating to this record, please contact us at [email protected] [email protected]