Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629)

From MaRDI portal
Revision as of 08:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
scientific article

    Statements

    title
    Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (English)
    0 references
    publication date
    26 October 2015
    0 references
    zbMATH Keywords
    clique problem
    0 references
    maximum clique
    0 references
    stochastic graph
    0 references
    distributed learning automata
    0 references
    social networks
    0 references
    cites work

    Identifiers

    Mathematics Subject Classification ID
    05C80
    0 references
    05C69
    0 references
    05C82
    0 references
    68Q45
    0 references
    68W15
    0 references
    zbMATH DE Number
    6498367
    0 references
    OpenAlex ID
    W2063745753
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3448629&oldid=36869145"
    Powered by MediaWiki