Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2010.03.030 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.03.030 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 10 December 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
0 references
