1. [1] T. Asai, H. Arimura, T. Uno, S. Nakano, and K. Satoh, “Efficient tree mining using reverse search,” Technical Report 218, Department of Informatics, Kyushu University, 2003.
2. [2] H. Arimura and T. Uno, “Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems,” Proc. of SIAM Int'l Conf. on Data Mining, pp.1087-1098, 2009.
3. Reverse search for enumeration
4. [4] M. Berlingerio, F. Bonchi, B. Bringmann, and A. Gionis, “Mining Graph Evolution Rules,” Proc. Euro. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD), pp.115-130, 2009.
5. [5] K. Borgwardt, H. Kriegel, and P. Wackersreuther, “Pattern mining in frequent dynamic subgraphs,” Proc. IEEE Int'l Conf. on Data Mining (ICDM), pp.818-822, 2006.