The Complexity of Mining Maximal Frequent Subgraphs (Q5012510): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q130964094, #quickstatements; #temporary_batch_1733743668271 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130964094 / rank | |||
Normal rank | |||
Latest revision as of 12:30, 9 December 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
