Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A simple parallel tree contraction algorithm
@@ Property / cites work: A simple parallel tree contraction algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Covering Vertices by Faces in a Planar Graph
+Normal rank
@@ Property / cites work @@
+Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
+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 @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036575
@@ Property / cites work: Q4036575 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing networks with compact routing tables
@@ Property / cites work: Designing networks with compact routing tables / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graph decomposition and all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms on planar graphs
@@ Property / cites work: Optimal parallel algorithms on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3711761
@@ Property / cites work: Q3711761 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01994878
+Normal rank
@@ Property / OpenAlex ID @@
+W1971715758
@@ Property / OpenAlex ID: W1971715758 / rank @@
+Normal rank