1. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of 2001 International Conference Data Mining (ICDM’01), pp. 313–320. San Jose, CA (2001)
2. Hollocou, A., Maudet, J., Bonald, T., Lelarge, M.: A streaming algorithm for graph clustering. NIPS 2017—Workshop on Advances in Modeling and Learning Interactions from Complex Data. Dec 2017, pp. 1–12. Long Beach, United States (2017)
3. Pradhan, S., Chakravarthy, S., Telang, A.: Modeling relational data as graphs for mining. In: 15th International Conference on Management of Data COMAD 2009, Mysore, India, December 9–12 (2009)
4. Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architecture for graph classification. In: The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18) (2018)
5. Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach, The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM