On the approximability of the maximum common subgraph problem
type: Item
instance of: scholarly article
title: On the approximability of the maximum common subgraph problem
zbMATH Open document ID: 1494.68196
DOI: 10.1007/3-540-55210-3_198
author: Viggo Kann
published in: STACS 92
publication date: 2022-08-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7573045
zbMATH Keywords: approximation
zbMATH Keywords: graph problems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 3-540-55210-3 198
OpenAlex ID: W1605991832
cites work: Subgraph isomorphism, matching relational structures and maximal cliques
cites work: On the complexity of approximating the independent set problem
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Linear approximation of shortest superstrings
cites work: Approximating maximum independent sets by excluding subgraphs
cites work: Q3484326
cites work: Worst-case analysis of a new heuristic for the travelling salesman problem
cites work: Q3974859
cites work: Q4058132
cites work: Q4198056
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Logical definability of NP optimization problems
cites work: The complexity of optimization problems
cites work: Matching theory
cites work: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
cites work: Edge-Deletion Problems
description: scientific article; zbMATH DE number 7573045