Inexact graph matching: A case of study

FLAIRS 2006 - Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference

Volumn 2006, Issue , 2006, Pages 586-591

  Olmos, Ivan ^a   Gonzalez, Jesus A ^a   Osorio, Mauricio ^b  

^a INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

^b UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; GENETIC ALGORITHMS; GRAPH THEORY; LEARNING SYSTEMS;

GENOME DATABASE; GRAPH MATCHING TOOLS; LIST CODE; UNDIRECTED GRAPHS;

PATTERN MATCHING;

EID: 33746036055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Brendan, D. M. 1981. Practial graph isomorphism. Congressus Numemntium 30:45-87.
2. Cook, D. J., and Holder, L. B. 1994. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research (1):231-255.
3. Cordella, L. P.; Foggia, P.; Sansone, C.; and Vento, M. 1996. An ef cient algorithm for the inexact matching of arg graphs using a contextual transformational model. Proceedings of the International Conference on Pattern Recognition 7276:180.
4. Cordella, L. P.; Foggia, P.: Sansone, C.: and Vento, M. 2001. An improved algorithm for matching large graphs. Proceedings of the 3rd IAPR-TCI5 Workshop on Graph-Based Representations in Pattern Recognition.
5. Hlaoui, A., and Wang, S. 2002. A new algorithm for inexact graph matching. 16th International Conference on Pattern Recognition.
6. Inokuchi, A., and Washio, T. M. 2003. Complete mining of frequent pattern from graphs: Mining graph data. Machine Learning, Kluwer Academic Publishers 321-354.
7. Kuramochi, M., and Karypis. 2002. An ef cient algorithm for discovering frequent subgraphs. Tech. Report. Dept. of Computing Science, University of Minnesota.
8. Luks, E. 1982. Isomoprhism of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences 25:42-65.
9. Michael, G. R., and David, J. S. 2003. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
10. Olmos, I.; Gonzalez, J. A.; and Osorio, M. 2005. Subgraph isomorphism detection using a code based representation. Proceedings of the 18th International FLAIRS Conference.
11. Ullman, R. J. 1976. An algorithm for subgraph isomorphism. Journal of the ACM 23(1):31-42.
12. Xifeng, Y., and Han, J. 2002. gspan: Graph - based sub-structure pattern mining. Technical Report, University of Illinois.