Pages that link to "Item:Q4698355"
From MaRDI portal
The following pages link to NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355):
Displaying 15 items.
- New (<i>α, β</i>) Spanners and Hopsets (Q5146883) (← links)
- Fine-grained complexity for sparse graphs (Q5230293) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q5361656) (← links)
- Algorithms – ESA 2004 (Q5464638) (← links)
- Light Spanners (Q5499739) (← links)
- Algorithms and Computation (Q5712167) (← links)
- (Q5875462) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- Lower bounds on the dilation of plane spanners (Q5890968) (← links)
- Fundamentals of Computation Theory (Q5900788) (← links)
- Vertex Sparsifiers: New Results from Old Techniques (Q5901179) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Spanners in randomly weighted graphs: Euclidean case (Q6047967) (← links)
- Routing on heavy path WSPD spanners (Q6600811) (← links)