A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking
Pasquale Foggia, Carlo Sansone, Mario Vento · 2001
Despite of the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task. The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of an algorithm is made on the basis of a few experimental data available on it. In this paper we describe a database containing 72,800 couples of simple graphs especially devised for comparing the performance of isomorphism and graph-subgraph isomorphism algorithms. The 72,800 couples are split into 18,200 couples of isomorphic graphs and 54,600 couples of graphs with a subgraph isomorphism mapping among them. The graphs include different categories