Distributed distance computation and routing with small messages (Q2422769)

From MaRDI portal
Revision as of 11:10, 4 December 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
Distributed distance computation and routing with small messages
scientific article

    Statements

    title
    Distributed distance computation and routing with small messages (English)
    0 references
    author
    Christoph Lenzen
    0 references
    Boaz Patt-Shamir
    0 references
    David Peleg
    0 references
    publication date
    20 June 2019
    0 references
    zbMATH Keywords
    CONGEST model
    0 references
    source detection
    0 references
    skeleton spanner
    0 references
    compact routing
    0 references
    all-pairs shortest paths
    0 references
    single-souce shortest paths
    0 references
    cites work
    Q4733694
    0 references
    On a routing problem
    0 references
    Q5743466
    0 references
    Q2768294
    0 references
    Q5363797
    0 references
    Q4944965
    0 references
    Graph spanners
    0 references
    Q4878300
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68M14
    0 references
    68Q06
    0 references
    68Q10
    0 references
    68W15
    0 references
    zbMATH DE Number
    7068759
    0 references
    OpenAlex ID
    W2793130010
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2422769&oldid=38019177"
    Powered by MediaWiki