The Compactness of Interval Routing for Almost All Graphs (Q2784477)

From MaRDI portal
Revision as of 10:14, 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
The Compactness of Interval Routing for Almost All Graphs
scientific article

    Statements

    title
    The Compactness of Interval Routing for Almost All Graphs (English)
    0 references
    author
    Cyril Gavoille
    0 references
    David Peleg
    0 references
    publication date
    23 April 2002
    0 references
    zbMATH Keywords
    interval routing
    0 references
    compact routing
    0 references
    random graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    68R10
    0 references
    05C80
    0 references
    68Q25
    0 references
    zbMATH DE Number
    1732365
    0 references
    OpenAlex ID
    W2092319564
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2784477&oldid=37034225"
    Powered by MediaWiki