Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135)

From MaRDI portal
Revision as of 01:32, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Subgraph extraction and metaheuristics for the maximum clique problem
scientific article

    Statements

    Subgraph extraction and metaheuristics for the maximum clique problem (English)
    0 references
    0 references
    0 references
    27 June 2017
    0 references
    maximum clique problem
    0 references
    triangulated graph
    0 references
    circular-arc graph
    0 references
    genetic algorithm
    0 references
    iterated local search
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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