Pages that link to "Item:Q5297139"

The following pages link to A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139):

Displaying 41 items.

• On dynamic shortest paths problems (Q639278) (← links)
• Sparse hop spanners for unit disk graphs (Q824328) (← links)
• Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
• On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
• A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
• New pairwise spanners (Q1693988) (← links)
• Relaxed spanners for directed disk graphs (Q1939674) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
• Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
• Faster cut sparsification of weighted graphs (Q2696277) (← links)
• COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
• Fully dynamic randomized algorithms for graph spanners (Q3189078) (← links)
• Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
• A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
• Approximating Shortest Paths in Graphs (Q3605483) (← links)
• (Q4449190) (← links)
• Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
• A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
• The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• Distributed Spanner Approximation (Q4997324) (← links)
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
• Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
• (Q5090437) (← links)
• Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
• (Q5090928) (← links)
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
• Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary (Q5146946) (← links)
• Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
• On the Complexity of Universal Leader Election (Q5501952) (← links)
• (Q5743389) (← links)
• Distributed construction of purely additive spanners (Q5915631) (← links)
• Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
• (Q6065466) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• Complexity of the multiobjective minimum weight minimum stretch spanner problem (Q6616272) (← links)