Single-source shortest paths in the CONGEST model with improved bounds (Q2166365): Difference between revisions

@@ 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.1007/s00446-021-00412-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3216836550
@@ Property / OpenAlex ID: W3216836550 / rank @@
+Normal rank
@@ Property / cites work @@
+A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
+Normal rank
@@ Property / cites work @@
+Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining shortest paths under deletions in weighted directed graphs
+Normal rank
@@ Property / cites work @@
+Distributed exact weighted all-pairs shortest paths in near-linear time
+Normal rank
@@ Property / cites work @@
+Fast Approximate Shortest Paths in the Congested Clique
+Normal rank
@@ Property / cites work @@
+Algebraic methods in the congested clique
@@ Property / cites work: Algebraic methods in the congested clique / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed verification and hardness of distributed approximation
+Normal rank
@@ Property / cites work @@
+Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Distributed exact shortest paths in sublinear time
+Normal rank
@@ Property / cites work @@
+Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
+Normal rank
@@ Property / cites work @@
+Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
+Normal rank
@@ Property / cites work @@
+Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
+Normal rank
@@ Property / cites work @@
+Improved distributed algorithms for exact shortest paths
+Normal rank
@@ Property / cites work @@
+A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
+Normal rank
@@ Property / cites work @@
+Optimal distributed all pairs shortest paths and applications
+Normal rank
@@ Property / cites work @@
+A Randomized Parallel Algorithm for Single-Source Shortest Paths
+Normal rank
@@ Property / cites work @@
+Fast routing table construction using small messages
+Normal rank
@@ Property / cites work @@
+Fast Partial Distance Estimation and Applications
@@ Property / cites work: Fast Partial Distance Estimation and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient distributed source detection with limited bandwidth
+Normal rank
@@ Property / cites work @@
+Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Distributed approximation algorithms for weighted shortest paths
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank