A fast deterministic detection of small pattern graphs in graphs without large cliques (Q2980911)
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 6711889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast deterministic detection of small pattern graphs in graphs without large cliques |
scientific article; zbMATH DE number 6711889 |
Statements
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (English)
0 references
5 May 2017
0 references
induced subgraph isomorphism
0 references
matrix multiplication
0 references
witnesses for Boolean matrix product
0 references
time complexity
0 references
0.9961838722229004
0 references
0.8394882082939148
0 references
0.8392230868339539
0 references
0.8254969120025635
0 references
0.8243764042854309
0 references
