On the approximability of the maximum common subgraph problem

This publication has 16 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• Maximum bounded 3-dimensional matching is MAX SNP-complete
  Information Processing Letters, 1991
• Linear approximation of shortest superstrings
  Published by Association for Computing Machinery (ACM) ,1991
• Approximating maximum independent sets by excluding subgraphs
  Published by Springer Nature ,1990
• The Steiner problem with edge lengths 1 and 2
  Information Processing Letters, 1989
• A structural overview of NP optimization problems
  Lecture Notes in Computer Science, 1989
• Completeness in approximation classes
  Published by Springer Nature ,1989
• On the complexity of approximating the independent set problem
  Published by Springer Nature ,1989
• Subgraph isomorphism, matching relational structures and maximal cliques
  Information Processing Letters, 1976
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
  Journal of the ACM, 1975