Subgraph enumeration in optimal I/O complexity (Q6902066)
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 8119426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subgraph enumeration in optimal I/O complexity |
scientific article; zbMATH DE number 8119426 |
Statements
Subgraph enumeration in optimal I/O complexity (English)
0 references
11 November 2025
0 references
subgraph enumeration
0 references
conjunctive queries
0 references
external memory
0 references
algorithms
0 references
