An algorithm for comparing unordered tree graphs based on a minimum cost mapping with minimal connectivity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

An algorithm for comparing unordered tree graphs based on a minimum cost mapping with minimal connectivity

Christophe Godin

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

hal-00307410 , version 1 (29-07-2008)

Identifiants

  • HAL Id : hal-00307410 , version 1

Citer

Pascal Ferraro, Christophe Godin. An algorithm for comparing unordered tree graphs based on a minimum cost mapping with minimal connectivity. Third Conference on orders, Algorithms and Applications, 1999, France. pp.115-116. ⟨hal-00307410⟩
79 Consultations
1 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More