Pages that link to "Item:Q1884872"
From MaRDI portal
The following pages link to A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872):
Displaying 40 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Sharing information for the all pairs shortest path problem (Q391758) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
- The Floyd-Warshall algorithm on graphs with negative cycles (Q991782) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
- An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs (Q1679504) (← links)
- A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (Q1944395) (← links)
- A spectral approach to the shortest path problem (Q2020688) (← links)
- Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← links)
- Solving all-pairs shortest path by single-source computations: theory and practice (Q2403799) (← links)
- Approximating the restricted 1-center in graphs (Q2424875) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← 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)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- A Forward-Backward Single-Source Shortest Paths Algorithm (Q5255013) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- (Q5743389) (← links)
- (Q5743466) (← links)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time (Q5862374) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
- Shortest distances as enumeration problem (Q6184314) (← links)
- Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)
