Finding maximal common subgraphs via time-space efficient reverse search (Q1790989)
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: Finding maximal common subgraphs via time-space efficient reverse search |
scientific article; zbMATH DE number 6946798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding maximal common subgraphs via time-space efficient reverse search |
scientific article; zbMATH DE number 6946798 |
Statements
Finding maximal common subgraphs via time-space efficient reverse search (English)
0 references
4 October 2018
0 references
common subgraphs
0 references
maximum common subgraph problem
0 references
0.8230295181274414
0 references
0.818986713886261
0 references
0.8028266429901123
0 references
0.7968748211860657
0 references
