A dynamic programming algorithm for the tree mapping problem

DOI10.1016/j.endm.2011.05.026zbMath1268.05199OpenAlexW2003174267MaRDI QIDQ2840699

G. A. Puglia, Alexandre S. Freire, 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

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

Cites Work

• Inexact graph matching for structural pattern recognition

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