A Consistency Rule for Graph Isomorphism Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A Consistency Rule for Graph Isomorphism Problem

Badreddine Benreguia
  • Fonction : Auteur

Résumé

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 in- put 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 com- plexity. Experimental results comparing CRGI with other popular algorithms show the effectiveness of CRGI especially for random graphs and trees.
Fichier non déposé

Dates et versions

hal-01353074 , version 1 (10-08-2016)

Identifiants

Citer

Badreddine Benreguia, Hamamache Kheddouci. A Consistency Rule for Graph Isomorphism Problem. 27th Symposium On Applied Computing - SAC 2012 , Mar 2012, Riva del Garda (Trento), Italy. pp.906-911, ⟨10.1145/2245276.2245453⟩. ⟨hal-01353074⟩
66 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More