Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649): 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.1016/j.tcs.2010.03.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171271527 / rank | |||
Normal rank | |||
Revision as of 20:46, 19 March 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
