The complexity of shortest path and dilation bounded interval routing (Q1575668): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:30, 1 February 2024

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