| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652604 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
