More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
From MaRDI portal
Recommendations
- A new approach to all-pairs shortest paths on real-weighted graphs
- A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- All-pairs shortest paths for unweighted undirected graphs in o(mn) time
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- scientific article; zbMATH DE number 2086613
- Two fast algorithms for all-pairs shortest paths
- Computing and Combinatorics
- All-Pairs Almost Shortest Paths
Cited in
(62)- Formally verified algorithms for upper-bounding state space diameters
- Extreme witnesses and their applications
- A new approach to all-pairs shortest paths on real-weighted graphs
- More on change-making and related problems
- Online routing and searching on graphs with blocked edges
- Approximating the minimum cycle mean
- Small-m method for detecting all longest paths
- Vertex labeling and routing for Farey-type symmetrically-structured graphs
- All-pairs shortest paths in geometric intersection graphs
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- All-pairs bottleneck paths in vertex weighted graphs
- Dynamic set intersection
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Extreme witnesses and their applications
- scientific article; zbMATH DE number 5289563 (Why is no real title available?)
- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
- Approximate shortest paths in weighted graphs
- Some results on approximate 1-median selection in metric spaces
- Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
- Faster all-pairs shortest paths via circuit complexity
- Subcubic equivalences between path, matrix, and triangle problems
- All-pairs shortest paths in geometric intersection graphs
- Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- scientific article; zbMATH DE number 2086613 (Why is no real title available?)
- Speeding up shortest path algorithms
- From circuit complexity to faster all-pairs shortest paths
- Faster Algorithms for All Pairs Non-Decreasing Paths Problem
- Using weighted graphs features for fast searching their parameters
- All-pairs shortest paths algorithm for high-dimensional sparse graphs
- Necklaces, convolutions, and \(X+Y\)
- A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds
- Faster all-pairs shortest paths via circuit complexity
- Proximity graphs inside large weighted graphs
- Sparse RNA folding: time and space efficient algorithms
- Algorithms and Data Structures
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
- Algorithms – ESA 2005
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Efficient parameterized algorithms for computing all-pairs shortest paths
- scientific article; zbMATH DE number 7651168 (Why is no real title available?)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- Efficient parameterized algorithms for computing all-pairs shortest paths
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
- All-pairs bottleneck paths in vertex weighted graphs
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Zoning of districts of the region according to the proximity to the external border
- \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
- Faster dynamic range mode
- Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
- On the space usage of approximate distance oracles with sub-2 stretch
- (, +) matrix and vector products for inputs decomposable into few monotone subsequences
- Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths
- Faster monotone min-plus product, range mode, and single source replacement paths
- Core-sparse Monge matrix multiplication: improved algorithm and applications
- Separating two points with obstacles in the plane: improved upper and lower bounds
- R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
- Average-case complexity of the min-sum matrix product problem
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
This page was built for publication: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053160)
