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 23 items.
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- New pairwise spanners (Q1693988) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- (Q5091203) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
