A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs