Polyhedral study of the maximum common induced subgraph problem (Q1761750): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank

Revision as of 19:33, 28 February 2024

scientific article
Language Label Description Also known as
English
Polyhedral study of the maximum common induced subgraph problem
scientific article

    Statements

    Polyhedral study of the maximum common induced subgraph problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum common induced subgraph
    0 references
    polyhedral combinatorics
    0 references
    integer programming
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    maximum clique
    0 references