Finding small complete subgraphs efficiently (Q6182903)
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 7781735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding small complete subgraphs efficiently |
scientific article; zbMATH DE number 7781735 |
Statements
Finding small complete subgraphs efficiently (English)
0 references
22 December 2023
0 references
triangle
0 references
subgraph detection/counting
0 references
graph arboricity
0 references
rectangular matrix multiplication
0 references
0 references
