Efficient Method to Perform Isomorphism Testing of Labeled Graphs

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=1c(|π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=1c(|π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.