A Performance Comparison of Five Algorithms for Graph Isomorphism

Abstract

Despite the significant number of isomorphism algorithms presentedin the literature, till now no efforts have been done to characterizetheir different performance in terms of matching time. It is notclear how the behavior of those algorithms varies as the type andthe size of the graphs to be matched varies in case of real applications.In this paper we present a benchmarking activity for characterizethe performance of a bunch of algorithms for exact isomorphism: tothis purpose we use a database of graphs specifically developed forthis task.