1. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: First IEEE International Conference on Data Mining (ICDM 2001), pp. 313–320. IEEE Computer Society, San Jose (2001)
2. Vanetik, N., Gudes, E., Shimony, S.E.: Computing Frequent Graph Patterns from Semistructured Data. In: Second IEEE International Conference on Data Mining (ICDM 2002), pp. 458–465. IEEE Computer Society, Maebashi City (2002)
3. Han, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraph in the presence of Isomorphims. In: 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 549–552. IEEE Computer Society, Melbourne (2003)
4. Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Second IEEE International Conference on Data Mining (ICDM 2002), pp. 721–723. IEEE Computer Society, Maebashi City (2002)
5. Christian, B.: An Implementation of the FP-growth Algorithm. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations (OSDM 2005), pp. 1–5. ACM, Chicago (2005)