Are unique subgraphs not easier to find? (Q1707980): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:08, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are unique subgraphs not easier to find? |
scientific article |
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
