Faster algorithms for the maximum common subtree isomorphism problem (Q4608592)
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 6851866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for the maximum common subtree isomorphism problem |
scientific article; zbMATH DE number 6851866 |
Statements
21 March 2018
0 references
MCS
0 references
maximum common subtree
0 references
enumeration algorithms
0 references
maximum weight bipartite matchings
0 references
0.900930404663086
0 references
0.8514161109924316
0 references
0.83897465467453
0 references
0.8341084718704224
0 references
0.824872612953186
0 references
