A dynamic programming algorithm for the tree mapping problem

DOI10.1016/J.ENDM.2011.05.026MaRDI QIDQ2840699zbMATH OpenOpenAlexFDO

Authors Alexandre S. Freire, G. A. Puglia, Carlos E. Ferreira

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2011.05.026

zbMATH Keywords

cost functiondynamic programming algorithmgraph mapping problemminimum cost mappingtree mapping problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
• Neighborhood-preserving mapping between trees
• Dynamic programming for the quadratic assignment problem on trees
• Compactness-preserving mapping on trees
• scientific article; zbMATH DE number 4083392

Cites work

• Inexact graph matching for structural pattern recognition

Cited in

(6)

• Neighborhood-preserving mapping between trees
• Tree transformation problem in microparallelism algorithms
• Compactness-preserving mapping on trees
• Lifted Dynamic Junction Tree Algorithm
• Revisiting dynamic programming for finding optimal subtrees in trees
• Dynamic programming and planarity: improved tree-decomposition based algorithms

This page was built for publication: A dynamic programming algorithm for the tree mapping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840699)