Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616)
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 6480905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay |
scientific article; zbMATH DE number 6480905 |
Statements
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (English)
0 references
11 September 2015
0 references
maximum common subgraph
0 references
Edmonds' algorithm
0 references
0.9083031
0 references
0.88561225
0 references
0.8783923
0 references
0.87709165
0 references
0.87615466
0 references
0.87615466
0 references
0.86795545
0 references
0 references
0.86641276
0 references
