Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (Q5212856): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962817833 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1904.03741 / rank | |||
Normal rank | |||
Latest revision as of 23:53, 19 April 2024
scientific article; zbMATH DE number 7160589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph pattern detection: hardness for all induced patterns and faster non-induced cycles |
scientific article; zbMATH DE number 7160589 |
Statements
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (English)
0 references
30 January 2020
0 references
cliques
0 references
cycle detection
0 references
fine-grained complexity
0 references
subgraph isomorphism
0 references
