Unique subgraphs are not easier to find (Q2855752): 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.1080/00207160.2012.701287 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2172178506 / rank | |||
Normal rank | |||
Revision as of 23:09, 19 March 2024
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
