Optimal mappings with minimum number of connected components in tree-to-tree comparison problems (Q4458886)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2055961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal mappings with minimum number of connected components in tree-to-tree comparison problems |
scientific article; zbMATH DE number 2055961 |
Statements
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems (English)
0 references
14 March 2004
0 references
minimum cost mapping
0 references
0.7961980104446411
0 references
0.7917680144309998
0 references
0.7878689169883728
0 references
0.7875834703445435
0 references
