Fault-Tolerant Compact Routing Schemes for General Graphs (Q3012912): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Forbidden-set distance labels for graphs of bounded doubling dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal static range reporting in one dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved routing strategies with succinct tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: f-Sensitivity Distance Oracles and Routing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Forbidden-Set Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity oracles for failure prone graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with low stretch factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory requirement for universal routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficiency for routing schemes of stretch factor three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / 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: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 06:53, 4 July 2024

scientific article
Language Label Description Also known as
English
Fault-Tolerant Compact Routing Schemes for General Graphs
scientific article

    Statements

    Fault-Tolerant Compact Routing Schemes for General Graphs (English)
    0 references
    0 references
    7 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references