Pages that link to "Item:Q2944530"
From MaRDI portal
The following pages link to Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (Q2944530):
Displaying 6 items.
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- New pairwise spanners (Q1693988) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics (Q6499237) (← links)
