Approximating Shortest Paths in Graphs (Q3605483): Difference between revisions

@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of network synchronization
@@ Property / cites work: Complexity of network synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471324
@@ Property / cites work: Q4471324 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
+Normal rank
@@ Property / cites work @@
+Q2921727
@@ Property / cites work: Q2921727 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449190
@@ Property / cites work: Q4449190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501268
@@ Property / cites work: Q5501268 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles for unweighted graphs in expected             <i>O</i>             (             <i>n</i>             <sup>2</sup>             ) time
+Normal rank
@@ Property / cites work @@
+A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
+Normal rank
@@ Property / cites work @@
+All-Pairs Small-Stretch Paths
@@ Property / cites work: All-Pairs Small-Stretch Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Computing almost shortest paths
@@ Property / cites work: Computing almost shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754183
@@ Property / cites work: Q2754183 / rank @@
+Normal rank
@@ Property / cites work @@
+$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Spanners and emulators with sublinear distance errors
+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