Comparison between ISMAGS, VF2, GK and G-Trie on the biological networks.

The top row denotes, for each algorithm, the number of runs averaged to obtain the reported timing results. However, for results denoted with an asterisk, only 1 run was performed. For the G-Trie algorithm, some results are missing as the size of the subgraph ( = 10 nodes) was not supported by the reference implementation. The results for the “P0P”, “P0P00P” and “P0P00P000P” are also omitted as the algorithm did not support “don't care” links.