Efficient algorithms for the periodic subgraphs mining problem
From MaRDI portal
Publication:2376786
DOI10.1016/j.jda.2012.05.002zbMath1268.05218OpenAlexW2089562314MaRDI 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
interactionsperiodicitysocial networksoptimal solutionsimple graphsmaximal subgraphsdiscovery algorithmsaverage numbertheoretical complexityimplicit desriptionmaximal periodic subgraphsminimum occurence thresholdregular intervalssequences of networkstemporal spantime \(O(|V|+|\widetilde E| \times T^2/sigma)\)
Related Items
Cites Work