Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q432250 |
||
| Property / author | |||
| Property / author: Tamás L. Horváth / rank | |||
Revision as of 00:17, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient frequent connected subgraph mining in graphs of bounded tree-width |
scientific article |
Statements
Efficient frequent connected subgraph mining in graphs of bounded tree-width (English)
0 references
7 July 2010
0 references
listing algorithms
0 references
frequent patterns
0 references
tree-width
0 references
graph mining
0 references
data mining
0 references
