The following pages link to (Q4829021):
Displaying 11 items.
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Relaxed spanners for directed disk graphs (Q1939674) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Compact roundtrip routing with topology-independent node names (Q5900132) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
