A dynamic programming algorithm for the tree mapping problem (Q2840699): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2011.05.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003174267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inexact graph matching for structural pattern recognition / rank | |||
Normal rank | |||
Latest revision as of 15:27, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming algorithm for the tree mapping problem |
scientific article |
Statements
A dynamic programming algorithm for the tree mapping problem (English)
0 references
23 July 2013
0 references
graph mapping problem
0 references
cost function
0 references
tree mapping problem
0 references
dynamic programming algorithm
0 references
minimum cost mapping
0 references
