1. E. Abdelhamid, I. Abdelaziz, P. Kalnis, Z. Khayyat, and F. Jamour. 2016. Scalemine: Scalable parallel frequent subgraph mining in a single large graph. In Proceedings of the SC.
2. I. Alobaidi, J. Leopold, and A. Allami. 2019. The use of frequent subgraph mining to develop a recommender system for playing real-time strategy games. In Proceedings of the ICDM. 146–160.
3. Ç. Aslay, M. A. U. Nasir, G. De Francisci Morales, and A. Gionis. 2018. Mining frequent patterns in evolving graphs. In Proceedings of the CIKM. 923–932.
4. S. K. Bera and C. Seshadhri. 2020. How to count triangles, without seeing the whole graph. In Proceedings of the KDD. 306–316.
5. Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel;Bhatia V.;Expert Systems with Applications,2018