Could any graph be turned into a small-world? (Q2368969)

From MaRDI portal
Revision as of 13:11, 24 June 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
Could any graph be turned into a small-world?
scientific article

    Statements

    title
    Could any graph be turned into a small-world? (English)
    0 references
    author
    Philippe Duchon
    0 references
    Nicolas Hanusse
    0 references
    Emmanuelle Lebhar
    0 references
    Nicolas Schabanel
    0 references
    publication date
    28 April 2006
    0 references
    zbMATH DE Number
    5020374
    0 references
    zbMATH Keywords
    Small-world
    0 references
    Random graph model
    0 references
    Routing algorithm
    0 references
    OpenAlex ID
    W2056455770
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2368969&oldid=34867721"
    Powered by MediaWiki