Pages that link to "Item:Q3189002"

The following pages link to Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners (Q3189002):

Displaying 11 items.

• On resilient graph spanners (Q289925) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
• Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
• Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• (Q5090437) (← links)
• Depth First Search in the Semi-streaming Model (Q5090492) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
• Online Spanners in Metric Spaces (Q6195959) (← links)