On the approximability of the maximum common subgraph problem (Q5096796): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subgraph isomorphism, matching relational structures and maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum independent sets by excluding subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical definability of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 21:43, 29 July 2024

scientific article; zbMATH DE number 7573045
Language Label Description Also known as
English
On the approximability of the maximum common subgraph problem
scientific article; zbMATH DE number 7573045

    Statements

    On the approximability of the maximum common subgraph problem (English)
    0 references
    0 references
    0 references
    18 August 2022
    0 references
    approximation
    0 references
    graph problems
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references