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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q115926707 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996615424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure-mapping engine: Algorithm and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack search algorithms and the maximal common subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Video indexing and similarity retrieval by largest common subgraph detection using decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258518 / rank
 
Normal rank

Latest revision as of 20:59, 5 July 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
    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

    Identifiers