Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient frequent connected subgraph mining in graphs of bounded tree-width |
scientific article; zbMATH DE number 5731728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient frequent connected subgraph mining in graphs of bounded tree-width |
scientific article; zbMATH DE number 5731728 |
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
0 references
0.9173433
0 references
0.9055539
0 references
0.90113884
0 references
