Pages that link to "Item:Q4629974"
From MaRDI portal
The following pages link to Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4629974):
Displaying 11 items.
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- 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)
- A Fast Algorithm for Constructing Sparse Euclidean Spanners (Q4354006) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- (Q5116490) (← links)
- (Q5875457) (← links)