A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565): Difference between revisions

@@ Property / DOI @@
-.1515/ausi-2016-0002
@@ Property / DOI: 10.1515/ausi-2016-0002 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/ausi-2016-0002
+Normal rank
@@ Property / OpenAlex ID @@
+W2468306032
@@ Property / OpenAlex ID: W2468306032 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+All-pairs-shortest-length on strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+A conjecture on Wiener indices in combinatorial chemistry
+Normal rank
@@ Property / cites work @@
+A New Combinatorial Approach for Sparse Graph Problems
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2878207
@@ Property / cites work: Q2878207 / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+Distances in benzenoid systems: Further developments
+Normal rank
@@ Property / cites work @@
+The average distance and the independence number
@@ Property / cites work: The average distance and the independence number / rank @@
+Normal rank
@@ Property / cites work @@
+Using Selective Path-Doubling for Parallel Shortest-Path Computations
+Normal rank
@@ Property / cites work @@
+Polylog-time and near-linear work approximation scheme for undirected shortest paths
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281631
@@ Property / cites work: Q4281631 / rank @@
+Normal rank
@@ Property / cites work @@
+MAD trees and distance-hereditary graphs
@@ Property / cites work: MAD trees and distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to compute a MAD tree of an interval graph
+Normal rank
@@ Property / cites work @@
+Computing the average distance of an interval graph
+Normal rank
@@ Property / cites work @@
+Average distance and independence number
@@ Property / cites work: Average distance and independence number / rank @@
+Normal rank
@@ Property / cites work @@
+Average distance and domination number
@@ Property / cites work: Average distance and domination number / rank @@
+Normal rank
@@ Property / cites work @@
+Average distance in weighted graphs
@@ Property / cites work: Average distance in weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Mean distance in a graph
@@ Property / cites work: Mean distance in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A more efficient algorithm for the min-plus multiplication
+Normal rank
@@ Property / cites work @@
+Wiener index of trees: Theory and applications
@@ Property / cites work: Wiener index of trees: Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Wiener index of hexagonal systems
@@ Property / cites work: Wiener index of hexagonal systems / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating all pairs shortest paths in restricted graph families: a unified approach
+Normal rank
@@ Property / cites work @@
+Distance in graphs
@@ Property / cites work: Distance in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4351067
@@ Property / cites work: Q4351067 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4882555
@@ Property / cites work: Q4882555 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique partitions, graph compression and speeding-up algorithms
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+All pairs shortest distances for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Q2754134
@@ Property / cites work: Q2754134 / rank @@
+Normal rank
@@ Property / cites work @@
+Unified all-pairs shortest path algorithms in the chordal hierarchy
+Normal rank
@@ Property / cites work @@
+Improved algorithm for all pairs shortest paths
@@ Property / cites work: Improved algorithm for all pairs shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Wiener number of vertex-weighted graphs and a chemical application
+Normal rank
@@ Property / cites work @@
+Q5743491
@@ Property / cites work: Q5743491 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4887753
@@ Property / cites work: Q4887753 / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive Segmentation with Intelligent Scissors
+Normal rank
@@ Property / cites work @@
+Average Distance, Independence Number, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Real-Weighted Undirected Graphs
+Normal rank
@@ Property / cites work @@
+A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
+Normal rank
@@ Property / cites work @@
+An optimal algorithm to solve the all-pair shortest path problem on interval graphs
+Normal rank
@@ Property / cites work @@
+An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
+Normal rank
@@ Property / cites work @@
+All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum average distance spanning tree of the hypercube
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank
@@ Property / cites work @@
+Integer priority queues with decrease key in constant time and the single source shortest paths problem
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q5471183
@@ Property / cites work: Q5471183 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Average Distance Clique Trees
@@ Property / cites work: Minimum Average Distance Clique Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / DOI @@
+.1515/AUSI-2016-0002
@@ Property / DOI: 10.1515/AUSI-2016-0002 / rank @@
+Normal rank