The complexity of shortest path and dilation bounded interval routing (Q1575668)

From MaRDI portal
Revision as of 00:16, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of shortest path and dilation bounded interval routing
scientific article

    Statements

    The complexity of shortest path and dilation bounded interval routing (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    compact routing
    0 references
    dilation bounded interval routing
    0 references
    complexity
    0 references