Abstract
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to approximate and is shown to be NPO PB-complete, i.e. complete in the class of optimization problems with optimal value bounded by a polynomial.
Author supplied keywords
Cite
CITATION STYLE
Kann, V. (1992). On the approximability of the maximum common subgraph problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 577 LNCS, pp. 377–388). Springer Verlag. https://doi.org/10.1007/3-540-55210-3_198
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
