Unique subgraphs are not easier to find (Q2855752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unique subgraphs are not easier to find |
scientific article |
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
