The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover

Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A. Rizk, Michael A. Langston. The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover. In 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 13-16 May 2007, Amman, Jordan. pages 367-373, IEEE, 2007. [doi]

@inproceedings{Abu-KhzamSRL07,
  title = {The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover},
  author = {Faisal N. Abu-Khzam and Nagiza F. Samatova and Mohamad A. Rizk and Michael A. Langston},
  year = {2007},
  doi = {10.1109/AICCSA.2007.370907},
  url = {http://dx.doi.org/10.1109/AICCSA.2007.370907},
  researchr = {https://researchr.org/publication/Abu-KhzamSRL07},
  cites = {0},
  citedby = {0},
  pages = {367-373},
  booktitle = {2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 13-16 May 2007, Amman, Jordan},
  publisher = {IEEE},
}