Unique subgraphs are not easier to find (Q2855752)
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: Unique subgraphs are not easier to find |
scientific article; zbMATH DE number 6217936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique subgraphs are not easier to find |
scientific article; zbMATH DE number 6217936 |
Statements
Unique subgraphs are not easier to find (English)
0 references
22 October 2013
0 references
graph algorithms
0 references
unique subgraph occurrence
0 references
subgraph isomorphism
0 references
induced subgraph isomorphism
0 references
time complexity
0 references
0 references
0.9283340573310852
0 references
0.9258904457092284
0 references
0.7690330743789673
0 references
0.7613568305969238
0 references
0.7563625574111938
0 references
