Optimal mappings with minimun number of connected components in tree-to-tree comparison problems

Pascal Ferraro (1) , Christophe Godin

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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)).

Domaines: Autre [cs.OH]

Pascal Ferraro, Christophe Godin. Optimal mappings with minimun number of connected components in tree-to-tree comparison problems. Journal of Algorithms in Cognition, Informatics and Logic, 2003, 48, pp.385-406. ⟨hal-00306620⟩