Pages that link to "Item:Q3189078"
From MaRDI portal
The following pages link to Fully dynamic randomized algorithms for graph spanners (Q3189078):
Displaying 23 items.
- On resilient graph spanners (Q289925) (← links)
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (Q1807649) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Randomized k-server algorithms for growth-rate bounded graphs (Q3022753) (← links)
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520) (← links)
- (Q4252412) (← links)
- Fully dynamic spanners with worst-case update time (Q4606286) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- (Q5090437) (← links)
- (Q5092428) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- Small Stretch Spanners on Dynamic Graphs (Q5301398) (← links)
- (Q5501325) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
