A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast deterministic detection of small pattern graphs in graphs without large cliques |
scientific article; zbMATH DE number 7050148
| 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 7050148 |
Statements
A fast deterministic detection of small pattern graphs in graphs without large cliques (English)
0 references
2 May 2019
0 references
induced subgraph isomorphism
0 references
matrix multiplication
0 references
witnesses for Boolean matrix product
0 references
time complexity
0 references
