An effective local search for the maximum clique problem (Q1041822)

From MaRDI portal
Revision as of 00:42, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56210425, #quickstatements; #temporary_batch_1712272666262)
scientific article
Language Label Description Also known as
English
An effective local search for the maximum clique problem
scientific article

    Statements

    title
    An effective local search for the maximum clique problem (English)
    0 references
    author
    Kengo Katayama
    0 references
    Akihiro Hamamoto
    0 references
    Hiroyuki Narihisa
    0 references
    publication date
    4 December 2009
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    combinatorial optimization
    0 references
    variable depth search
    0 references
    neighborhood
    0 references
    maximum clique problem
    0 references
    describes a project that uses
    Max-AO
    0 references
    DIMACS
    0 references
    Tabu search
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P10
    0 references
    68R10
    0 references
    68W05
    0 references
    05C85
    0 references
    zbMATH DE Number
    5642388
    0 references
    OpenAlex ID
    W2108455025
    0 references
    Wikidata QID
    Q56210425
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1041822&oldid=33246372"
    Powered by MediaWiki