Revisiting dynamic programming for finding optimal subtrees in trees (Q856203)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting dynamic programming for finding optimal subtrees in trees |
scientific article; zbMATH DE number 5078470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting dynamic programming for finding optimal subtrees in trees |
scientific article; zbMATH DE number 5078470 |
Statements
Revisiting dynamic programming for finding optimal subtrees in trees (English)
0 references
7 December 2006
0 references
heuristics
0 references
dynamic programming
0 references
combinatorial optimization
0 references
0 references
0 references
0.9100383
0 references
0.90862036
0 references
0.90862036
0 references
0.89960665
0 references
0 references
0.8862481
0 references
