article · Electronic Notes in Discrete Mathematics · 2011
A dynamic programming algorithm for the tree mapping problem
Carlos Eduardo Ferreira, Alexandre Freire, G.A. Puglia
Cited by 1Open access
Abstract
The index has no abstract for this paper. The publisher’s page may have one.
Cite this paper
Ferreira, C. E., Freire, A., & Puglia, G. (2011). A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics, 37, 147–152. https://doi.org/10.1016/j.endm.2011.05.026
Ferreira, Carlos Eduardo, et al. “A dynamic programming algorithm for the tree mapping problem.” Electronic Notes in Discrete Mathematics, vol. 37, 2011, pp. 147–52, https://doi.org/10.1016/j.endm.2011.05.026.
Ferreira, Carlos Eduardo, Alexandre Freire, and G.A. Puglia. 2011. “A dynamic programming algorithm for the tree mapping problem.” Electronic Notes in Discrete Mathematics 37: 147–52. https://doi.org/10.1016/j.endm.2011.05.026.
Ferreira, C.E., Freire, A. and Puglia, G. (2011) ‘A dynamic programming algorithm for the tree mapping problem’, Electronic Notes in Discrete Mathematics, 37, pp. 147–152. Available at: https://doi.org/10.1016/j.endm.2011.05.026.
@article{ferreira2011dynamic,
title = {{A dynamic programming algorithm for the tree mapping problem}},
author = {Ferreira, Carlos Eduardo and Freire, Alexandre and Puglia, G.A.},
journal = {Electronic Notes in Discrete Mathematics},
volume = {37},
pages = {147--152},
year = {2011},
doi = {10.1016/j.endm.2011.05.026}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.