The Complexity of Interval Routing on Random Graphs (Q3842955)

From MaRDI portal
Revision as of 20:48, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Interval Routing on Random Graphs
scientific article

    Statements

    title
    The Complexity of Interval Routing on Random Graphs (English)
    0 references
    author
    Michele Flammini
    0 references
    Jan van Leeuwen
    0 references
    publication date
    25 January 1999
    0 references
    Mathematics Subject Classification ID
    68W10
    0 references
    68M99
    0 references
    68R10
    0 references
    zbMATH DE Number
    1192540
    0 references
    zbMATH Keywords
    compact routing
    0 references
    complete routing tables
    0 references
    OpenAlex ID
    W2158235975
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3842955&oldid=31615983"
    Powered by MediaWiki