The Complexity of Mining Maximal Frequent Subgraphs (Q5012510): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:17, 8 February 2024
scientific article; zbMATH DE number 7433145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Mining Maximal Frequent Subgraphs |
scientific article; zbMATH DE number 7433145 |
Statements
The Complexity of Mining Maximal Frequent Subgraphs (English)
0 references
25 November 2021
0 references
graph mining
0 references
enumeration complexity
0 references
maximal frequent subgraphs
0 references
