Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (Q5212856)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7160589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.998319149017334
0 references
0.8254969120025635
0 references
0.8219857811927795
0 references
0.8070937991142273
0 references
0.8005858063697815
0 references
