Are unique subgraphs not easier to find? (Q1707980)
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: Are unique subgraphs not easier to find? |
scientific article; zbMATH DE number 6855757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Are unique subgraphs not easier to find? |
scientific article; zbMATH DE number 6855757 |
Statements
Are unique subgraphs not easier to find? (English)
0 references
4 April 2018
0 references
subgraph isomorphism
0 references
induced subgraph isomorphism
0 references
unique subgraph occurrence
0 references
time complexity
0 references
0 references
0.9258904457092284
0 references
0.8812126517295837
0 references
0.7788727879524231
0 references
0.768733024597168
0 references
0.7684072852134705
0 references
