Efficient Method to Perform Isomorphism Testing of Labeled Graphs
- 667 Downloads
The need to perform isomorphism testing is emerging recently in many application domains such as graph-based data mining for discovering frequent common patterns in a graph database. Due to the complex nature of graph representations, the isomorphism testing between labeled graphs is one of the most time-consuming phases during the mining process. The canonical form of a graph that serves as the isomorphism certificate needs O(n!) to produce for a graph of order n, or Θ(Π i = 1 c (|π i |!)) if vertex invariants are employed to divide n vertices into c equivalence classes with |π i | vertices in each class i. In this paper, we propose a new algorithm to perform isomorphism testing of labeled graphs with worst case time complexity O(Σ i = 1 c (|π i |!)), in which the product of all |π i |! terms is replaced by the sum of the terms and the asymptotic notation is changed from big theta to big oh. To the best of our knowledge, this proposed model is the latest work that focuses on the dealing of the isomorphism testing of labeled graphs. The result of this algorithm is directly applicable to the fields of graph isomorphism testing for labeled graphs.
KeywordsLarge Neighbor Label Graph Edge Label Graph Isomorphism Feasibility Testing
Unable to display preview. Download preview PDF.
- 2.Chartrand, G., Zhang, P. (eds.): Introduction to Graph Theory. McGraw Hill, New York (2002)Google Scholar
- 5.Foggia, P., Sansone, C., Vento, M.: A Performance Comparison of Five Algorithms for Graph Isomorphism. In: Proc. of the 3rd IAPR-TC15 Workshop on Graph-based Representation (2001)Google Scholar
- 7.Hsieh, S.M., Hsu, C.C.: New Method for Similarity Retrieval of Iconic Image Database. In: Proceedings of 2005 SPIE-IS&T Symposium on Electronic Imaging: Conference on Storage and Retrieval Methods and Applications for Multimedia, vol. 5682, pp. 247–257 (2005)Google Scholar
- 8.Hong, P., Huang, T.: Mining Inexact Spatial Patterns. In: Workshop on Discrete Mathematics and Data Mining (2002)Google Scholar
- 9.Huan, J., Wang, W., Prims, J.: Efficient Mining of Frequent Subgraph in the Presence of Isomorphism, University of North Carolina Computer Science Technical Report (2003)Google Scholar
- 12.McKay, B.D.: Nauty Users Guide (2003), http://cs.anu.edu.au/~bdm/nauty
- 13.McKay, B.D.: Practical Graph Isomorphism. Congressus Numerantium, 30, 45–87 (1981)Google Scholar
- 14.Neapolitan, R., Naimipour, K.: Foundations of Algorithms. D. C. Heath and Company, Massachusetts (1996)Google Scholar
- 19.Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proceedings of 2002 IEEE Int’l Conference on Data Mining (2002)Google Scholar