A consistency rule for graph isomorphism problem

Authors:
Badreddine Benreguia;Hamamache Kheddouci
Affiliations:
Université Abderrahmane Mira, Targa Ouzemour, Béjaia, Algerie;Lyon1 University, Villeurbanne Cedex, France
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 7
Cited 0

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

Journal of the ACM (JACM)
Graph Matching: A Fast Algorithm and Its Evaluation

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Algorithm for Graph Isomorphism Testing

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an algorithm for graph isomorphism problem. A consistency rule is proposed to detect as soon as possible the isomorphism permutation. The algorithm, called CRGI, tries to find an isomorphism between two input graphs through a backtracking exploration that uses a proposed consistency rule to prune the tree-search. This rule is based on changing cases positions of one adjacency matrix to obtain exactly the second adjacency matrix, according to a permutation that must be defined. If such permutation exists, an isomorphism is detected. The proposed rule is able to prune as early as possible unfruitful branches of the tree-search which leads to reduce the practical time complexity. Experimental results comparing CRGI with other popular algorithms show the effectiveness of CRGI especially for random graphs and trees.