Pages that link to "Item:Q4575779"
From MaRDI portal
The following pages link to Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4575779):
Displaying 12 items.
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- A Fast Algorithm for Constructing Sparse Euclidean Spanners (Q4354006) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5002727) (← links)
- (Q5002766) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5090437) (← links)
- (Q5116490) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
