1. [Arimura 07] Arimura, H., Uno, T., and Shimozono, S.: Time and Space Efficient Discovery of Maximal Geometric Graphs, Proceedings of the 10th International Conference on Discovery Science, pp. 42-55 (2007)
2. [Avis 93] Avis, D. and Fukuda, K.: Reverse Search for Enumeration, Discrete Applied Mathematics, Vol. 65, pp. 21--46 (1993)
3. [Barabasi 02] Barabasi, A.-L.: Linked: The New Science of Networks, Basic Books (2002)
4. [Blei 03] Blei, D. M., Ng, A. Y., and Jordan, M. I.: Latent dirichlet allocation, Journal of Machine Learning Research, Vol. 3, pp. 993--1022 (2003)
5. [Borgelt 05] Borgelt, C.: On Canonical Forms for Frequent Graph Mining, Working Notes of the Third International ECML/PKDD-Workshop on Mining Graphs, pp. 1--12 (2005)