Greed is good for deterministic scale-free networks (Q2205637)

From MaRDI portal
Revision as of 02:46, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Greed is good for deterministic scale-free networks
scientific article

    Statements

    title
    Greed is good for deterministic scale-free networks (English)
    0 references
    author
    Ankit Chauhan
    0 references
    Tobias Friedrich
    0 references
    Ralf Rothenberger
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 October 2020
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C80
    0 references
    68Q17
    0 references
    68W25
    0 references
    90C35
    0 references
    zbMATH DE Number
    7263190
    0 references
    zbMATH Keywords
    random graphs
    0 references
    deterministic properties
    0 references
    power-law
    0 references
    approximation
    0 references
    APX-hardness
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2205637&oldid=14741771"
    Powered by MediaWiki