Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864): Difference between revisions

@@ Property / cites work @@
+Complexity of network synchronization
@@ Property / cites work: Complexity of network synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+A new distributed depth-first-search algorithm
@@ Property / cites work: A new distributed depth-first-search algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4733694
@@ Property / cites work: Q4733694 / rank @@
+Normal rank
@@ Property / cites work @@
+A new distributed algorithm to find breadth first search trees
+Normal rank
@@ Property / cites work @@
+On the Complexity of Covering Vertices by Faces in a Planar Graph
+Normal rank
@@ Property / cites work @@
+Q3741076
@@ Property / cites work: Q3741076 / 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 @@
+Space-efficient and fault-tolerant message routing in outerplanar networks
+Normal rank