DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS

Keyphrases

• Graph Decomposition 100%
• Low Stretch 100%
• Graph Diameter 100%
• Single-source Shortest Paths 100%
• Low-diameter 100%
• Shortest Path Computation 100%
• Streaming Model 66%
• Semi-streaming 66%
• SANSA 66%
• Node number 33%
• Computational Complexity 33%
• Probability-based 33%
• Randomized Algorithms 33%
• Asymptotically Optimal 33%
• Tree-based 33%
• Fundamental Challenges 33%
• Models of Computation 33%
• Spanning Tree 33%
• Unweighting 33%
• Decomposition Method 33%
• Embedding Algorithm 33%
• Undirected Weighted Graph 33%
• Small Edges 33%
• Miller 33%
• Distance Approximation 33%
• Edge Cut 33%
• Metric Tree 33%
• Tree Embedding 33%
• Capacitated Problem 33%
• Hop-diameter 33%
• Decentralized Model 33%

Mathematics

• Edge 100%
• Approximates 66%
• Polynomial 33%
• Probability Theory 33%
• Model of Computation 33%
• Spanning Tree 33%
• Weighted Undirected Graph 33%
• Main Result 33%

Computer Science

• Shortest Path Computation 100%
• Computational Complexity 33%
• Approximation (Algorithm) 33%
• Randomized Algorithm 33%
• Embedding Algorithm 33%
• Model of Computation 33%
• weighted graph 33%
• Spanning Tree 33%