References
- 1. Demetrovics, J., V. D. Thi, N. L. Giang. On Finding All Reducts of Consistent Decision Tables. - Cybernetics and Information Technologies, Vol. 14, 2014, No 4, pp. 3-10.
- 2. Eppstein, D. Subgraph Isomorphism in Planar Graphs and Related Problems. - In SODA, Vol. 95, 1995, pp. 632-640.
- 3. Garey, M. R., D. S. Johnso n. Computers and Intractability: An Introduction to the Theory of Np-Completeness. San Francisco, 1979.
- 4. Han, J., H. Cheng, D. Xin, X. Yan. Frequent Pattern Mining: Current Status and Future Directions. - Data Mining and Knowledge Discovery, Vol. 15, 2007, No 1, pp. 55-86.
- 5. Hopcroft, J. E., R. E. Tarjan. Isomorphism of Planar Graphs. - In: Complexity of Computer Computations. Springer, 1972, pp. 131-152.
- 6. Huan J., W. Wang, J. Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. - In: 3rd IEEE International Conference on Data Mining, 2003 (ICDM’2003), IEEE, 2003, pp. 549-552.
- 7. Huan, J., W. Wang, J. Prins, J. Yang. Spin: Mining Maximal Frequent Subgraphs from Graph Databases. - In: Proc. of 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2004, pp. 581-586.
- 8. Inokuchi, A., T. Washio, H. Motoda. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. - In: European Conference on Principles of Data Mining and Knowledge Discovery, Springer, 2000, pp. 13-23.
- 9. Kuramochi M., G. Karypi s. Frequent Subgraph Discovery. - In: Proc. of IEEE International Conference on Data Mining, 2001. ICDM 2001, IEEE, 2001, pp. 313-320.
- 10. Mc Kay, B. D., et al. Practical Graph Isomorphism. Department of Computer Science, Vanderbilt University Tennessee, US, 1981.
- 11. Read, R. C., D. G. Cornei l. The Graph Isomorphism Disease. - Journal of Graph Theory, Vol. 1, 1977, No 4, pp. 339-363.
- 12. Savage, J. E. Models of Computation. Exploring the Power of Computing, 1998.
- 13. Thi, V. D., N. L. Giang. A Method to Constructa Decision Table froma Relation Scheme. - Cybernetics and Information Technologies, Vol. 11, 2011, No 3, pp. 32-41.
- 14. Thomas, L. T., S. R. Valluri, K. Karlapalem. Margin: Maximal Frequent Subgraph Mining. - ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 4, 2010, No 3, pp. 10.
- 15. Ullmann, J. R. An Algorithm for Subgraph Isomorphism. - Journal of the ACM (JACM), Vol. 23, 1976, No 1, pp. 31-42.
- 16. Washio, T., H. Motoda. State of the Art of Graph-Based Data Mining. - ACM Sigkdd Explorations Newsletter, Vol. 5, 2003, No 1, pp. 59-68.
- 17. Yan, X., J. Han. GSPAN: Graph-Based Substructure Pattern Mining. - In: Proc. of 2002 IEEE International Conference on Data Mining, 2002. ICDM 2003, IEEE, 2002, pp. 721-724.
- 18. Yan, X., J. Han. Closegraph: Mining Closed Frequent Graph Patterns. - In: Proc. of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2003, pp. 286-295.