Login / Signup

The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover.

Faisal N. Abu-KhzamNagiza F. SamatovaMohamad A. RizkMichael A. Langston
Published in: AICCSA (2007)
Keyphrases
  • vertex cover
  • approximation algorithms
  • maximum common subgraph
  • partial order
  • np hard
  • special case
  • data structure
  • search space
  • simulated annealing