The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover | IEEE Conference Publication | IEEE Xplore