The Complexity of Mining Maximal Frequent Subgraphs (Q5012510): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2629550 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2764187464 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 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
