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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Rastislav Královič / rank
Normal rank
 
Property / author
 
Property / author: Peter Ružička / rank
Normal rank
 
Property / author
 
Property / author: Daniel Štefanković / rank
Normal rank
 
Property / author
 
Property / author: Rastislav Královič / rank
 
Normal rank
Property / author
 
Property / author: Peter Ružička / rank
 
Normal rank
Property / author
 
Property / author: Daniel Štefanković / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of interval routing on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of networks supporting linear interval routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for compact routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic routing with bounded buffers: turning offline into online protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4345573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Routing / rank
 
Normal rank

Revision as of 13:13, 30 May 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
    21 August 2000
    0 references
    0 references
    compact routing
    0 references
    dilation bounded interval routing
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references