An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027): Difference between revisions

@@ Property / Wikidata QID @@
+Q51999546
@@ Property / Wikidata QID: Q51999546 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Parallel Algorithms for String Editing and Related Problems
+Normal rank
@@ Property / cites work @@
+A faster parallel algorithm for a matrix searching problem
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785966
@@ Property / cites work: Q3785966 / 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 @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q3751390
@@ Property / cites work: Q3751390 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic maintenance of planar digraphs, with applications
+Normal rank