Efficient algorithms for the periodic subgraphs mining problem (Q2376786): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Péter L. Erdős / rank | |||
| Property / author | |||
| Property / author: Q411653 / rank | |||
Revision as of 20:45, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the periodic subgraphs mining problem |
scientific article |
Statements
Efficient algorithms for the periodic subgraphs mining problem (English)
0 references
24 June 2013
0 references
discovery algorithms
0 references
sequences of networks
0 references
social networks
0 references
periodicity
0 references
interactions
0 references
maximal periodic subgraphs
0 references
time \(O(|V|+|\widetilde E| \times T^2/sigma)\)
0 references
maximal subgraphs
0 references
optimal solution
0 references
minimum occurence threshold
0 references
simple graphs
0 references
regular intervals
0 references
temporal span
0 references
theoretical complexity
0 references
implicit desription
0 references
average number
0 references
