Distributed distance computation and routing with small messages (Q2422769): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Near-linear lower bounds for distributed distance computations, even in sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved routing strategies with succinct tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining shortest paths under deletions in weighted directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed computation of distance sketches in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification and hardness of distributed approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of distributed sparse spanner construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Efficient Distributed Construction of Near Optimal Routing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and localized distributed data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed all pairs shortest paths and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic approximation scheme for shortest paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast routing table construction using small messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed steiner forest construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Partial Distance Estimation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed source detection with limited bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Network Diameter and Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / 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: Q4878300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed network protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models / rank
 
Normal rank

Latest revision as of 11:10, 4 December 2024

scientific article
Language Label Description Also known as
English
Distributed distance computation and routing with small messages
scientific article

    Statements

    Distributed distance computation and routing with small messages (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references