Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226)

From MaRDI portal
Revision as of 23:53, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
scientific article

    Statements

    Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (English)
    0 references
    0 references
    15 November 2012
    0 references
    critical node detection
    0 references
    complex networks
    0 references
    random graph
    0 references
    simulated annealing
    0 references
    population-based incremental learning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references