On the complexity of triangle counting using emptiness queries (Q6663065)
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 7966957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of triangle counting using emptiness queries |
scientific article; zbMATH DE number 7966957 |
Statements
On the complexity of triangle counting using emptiness queries (English)
0 references
14 January 2025
0 references
triangle counting
0 references
emptiness queries
0 references
bipartite independent set query
0 references
