Title of article
A dynamic programming algorithm for the tree mapping problem
Author/Authors
Ferreira، نويسنده , , C.E. and Freire، نويسنده , , A.S. and Puglia، نويسنده , , G.A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
147
To page
152
Abstract
In the graph mapping problem two graphs and a cost function are given as input and the goal is to find a minimum cost mapping of the vertex set of one graph into the vertex set of the other graph. In this paper we introduce a dynamic programming algorithm for the tree mapping problem (i.e., the variant of the problem in which the input graphs are trees), which is still NP-hard, and evaluate its performance with computational experiments.
Keywords
tree mapping , Dynamic programming
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455673
Link To Document