1. A. Inokuchi, T. Washio, H. Motoda, An apriori-based algorithm for mining frequent substructures from graph data, in: Principles of Data Mining and Knowledge Discovery, 4th European Conference (PKDD 2000), 2000, pp. 13–23.
2. M. Kuramochi, G. Karypis, Frequent subgraph discovery, in: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM 2001), 2001, pp. 313–320.
3. X. Yan, J. Han, gspan: Gaph-based substructure pattern mining, in: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002, pp. 721–724.
4. C. Wang, W. Wang, J. Pei, Y. Zhu, B. Shi, Scalable mining of large disk-based graph databases, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2004), 2004, pp. 316–325.
5. J. Huan, W. Wang, J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, in: Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), 2003, pp. 549–552.