Efficient algorithms for the periodic subgraphs mining problem
From MaRDI portal
Publication:2376786
DOI10.1016/j.jda.2012.05.002zbMath1268.05218MaRDI QIDQ2376786
Zsuzsanna Lipták, Alberto Apostolico, Cinzia Pizzi, Ervin Gyoeri, Péter L. Erdős
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.05.002
interactions; periodicity; social networks; optimal solution; simple graphs; maximal subgraphs; discovery algorithms; average number; theoretical complexity; implicit desription; maximal periodic subgraphs; minimum occurence threshold; regular intervals; sequences of networks; temporal span; time \(O(|V|+|\widetilde E| \times T^2/sigma)\)
Related Items
Cites Work