Pages that link to "Item:Q4268701"
From MaRDI portal
The following pages link to Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) (Q4268701):
Displaying 50 items.
- On resilient graph spanners (Q289925) (← links)
- Approximate shortest paths in weighted graphs (Q414929) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- New pairwise spanners (Q1693988) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← 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)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Equality of opportunity and integration in social networks (Q2162171) (← links)
- Fast diameter computation within split graphs (Q2180143) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- An experimental study on approximating \(k\) shortest simple paths (Q2828199) (← links)
- External-memory exact and approximate all-pairs shortest-paths in undirected graphs (Q2921735) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- (Q5090924) (← links)
- (Q5091199) (← links)
