Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by one other user not shown)
Property / DOI
 
Property / DOI: 10.1137/22m1489034 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Hierarchy of Lower Bounds for Sublinear Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using petal-decompositions to build a low stretch spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithm for graph spanners-single pass and constant processing time per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Source Shortest Paths in the CONGEST Model with Improved Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Strong Diameter Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Routing for the Lp-norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic low-stretch trees via dynamic low-diameter decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Distributed Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral sparsification via random spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed approximation algorithms via probabilistic tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly-m log n Time Solver for SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching Optimality for Solving SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed distance computation and routing with small messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / 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: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/22M1489034 / rank
 
Normal rank

Latest revision as of 18:57, 30 December 2024

scientific article; zbMATH DE number 7820560
Language Label Description Also known as
English
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
scientific article; zbMATH DE number 7820560

    Statements

    Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2024
    0 references
    distributed graph algorithms
    0 references
    parallel graph algorithms
    0 references
    (semi-)streaming graph algorithms
    0 references
    metric tree embeddings
    0 references
    low-stretch trees
    0 references
    graph decompositions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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