Comparing performance of graph matching algorithms on huge graphs

•Five state of the art subgraph isomorphism algorithms have been compared.•Eight different datasets publicly available have been used in our experimentation.•The datasets have been extracted from both synthetic and real data.•Eleven different typologies of synthetic graphs have been included in the synthetic part of the dataset.•The experimentation required an impressive time of 556 days.