1. C. Faloutsos, K.S. Mccurley, A. Tomkins, Connection subgraphs in social networks, in: Workshop on Link Analysis, Counterterrorism, and Privacy, SIAM International Conference on Data Mining, 2004.
2. M. Kuramochi, G. Karypis, Frequent Subgraph Discovery, in: Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM '01, IEEE Computer Society, Washington, DC, USA, 2001, pp. 313–320.
3. S. Nijssen, J.N. Kok, A quickstart in frequent structure mining can make a difference, in: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '04, ACM, New York, NY, USA, 2004, pp. 647–652.
4. X. Yan, J. Han, gSpan: graph-based substructure pattern mining, in: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM '02, IEEE Computer Society, Washington, DC, USA, 2002, pp. 721–724.
5. M. Wörlein, T. Meinl, I. Fischer, M. Philippsen, A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston, in: Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD'05, Springer-Verlag, Berlin, Heidelberg, 2005, pp. 392–403.