Are unique subgraphs not easier to find? (Q1707980): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2018.02.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2018.02.010 / rank | |||
Normal rank | |||
Latest revision as of 06:05, 11 December 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
0 references
