The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover

@article{AbuKhzam2007TheMC,
  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},
  journal={2007 IEEE/ACS International Conference on Computer Systems and Applications},
  year={2007},
  pages={367-373}
}
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications, MCS is a familiar and challenging problem. Many algorithms exist that can deliver optimal MCS solutions, but whose asymptotic worst-case run times fail to do better than mere brute-force, which is exponential in the order of the smaller graph. In this paper, we present a faster solution to MCS. We transform an… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
17 Extracted Citations
14 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 17 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Finding a maximum independent set in time O(2n/4)

  • J. M. Robson
  • Technical Report 1251-01,
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…