Pages that link to "Item:Q4629974"
From MaRDI portal
The following pages link to Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4629974):
Displayed 9 items.
- Graph spanners: a tutorial review (Q2026289) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- (Q5875457) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)