Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:52, 5 March 2024
scientific article; zbMATH DE number 7430751
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles |
scientific article; zbMATH DE number 7430751 |
Statements
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (English)
0 references
19 November 2021
0 references
fine-grained complexity
0 references
subgraph isomorphism
0 references
cliques
0 references
cycle detection
0 references
