Are unique subgraphs not easier to find? (Q1707980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2790074285 / rank | |||
Normal rank | |||
Revision as of 23:16, 19 March 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
