Efficient algorithms for the periodic subgraphs mining problem

DOI10.1016/J.JDA.2012.05.002zbMATH Open1268.05218OpenAlexW2089562314MaRDI QIDQ2376786FDOQ2376786

Authors: Alberto Apostolico, Zsuzsanna Lipták, Cinzia Pizzi, Péter L. Erdős, Ervin Győri 

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

Recommendations

• Speedup for a periodic subgraph miner
• Mining preserving structures in a graph sequence
• Mining preserving structures in a graph sequence
• The Complexity of Mining Maximal Frequent Subgraphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs

zbMATH Keywords

interactionssocial networksoptimal solutionperiodicitysimple graphsmaximal subgraphsdiscovery algorithmsaverage numbertheoretical complexityimplicit desriptionmaximal periodic subgraphsminimum occurence thresholdregular intervalssequences of networkstemporal spantime \(O(|V|+|\widetilde E| \times T^2/sigma)\)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Speedup for a periodic subgraph miner

Cited In (7)

• Graph signatures: identification and optimization
• Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
• Mining preserving structures in a graph sequence
• String cadences
• Mining preserving structures in a graph sequence
• Speedup for a periodic subgraph miner
• Irredundant tandem motifs

This page was built for publication: Efficient algorithms for the periodic subgraphs mining problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376786)