Pages that link to "Item:Q960518"
From MaRDI portal
The following pages link to On the all-pairs-shortest-path problem in unweighted undirected graphs. (Q960518):
Displaying 50 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- Reconstructing shortest paths (Q918442) (← links)
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Solving path problems on the GPU (Q991105) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Some optimization problems on weak-bisplit graphs (Q1029034) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- A branch-checking algorithm for all-pairs shortest paths (Q1763152) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- A spectral approach to the shortest path problem (Q2020688) (← links)
- Percolation centrality via Rademacher Complexity (Q2091801) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths (Q2380054) (← links)
- Improved algorithm for all pairs shortest paths (Q2390321) (← links)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Regularity lemmas and combinatorial algorithms (Q2913804) (← links)
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
- On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem (Q2971390) (← links)
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs (Q3053160) (← links)
- TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS (Q3056034) (← links)
- Shortest-Path Reconstruction Algorithms (Q3140120) (← links)
- Approximation bounds for Black Hole Search problems (Q3548722) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- (Q5091161) (← links)
- Estimating all pairs shortest paths in restricted graph families: a unified approach (Q5704853) (← links)
