Parallel algorithms for routing in nonblocking networks (Q4277375): Difference between revisions

@@ Property / cites work @@
+On-Line Algorithms for Path Selection in a Nonblocking Network
+Normal rank
@@ Property / cites work @@
+Optimal Rearrangeable Multistage Connecting Networks
+Normal rank
@@ Property / cites work @@
+On non-blocking switching networks
@@ Property / cites work: On non-blocking switching networks / rank @@
+Normal rank
@@ Property / cites work @@
+Wide-Sense Nonblocking Networks
@@ Property / cites work: Wide-Sense Nonblocking Networks / rank @@
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for routing in permutation networks
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Rearrangeable Networks with Limited Depth
@@ Property / cites work: Rearrangeable Networks with Limited Depth / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01187091
+Normal rank
@@ Property / OpenAlex ID @@
+W4236500839
@@ Property / OpenAlex ID: W4236500839 / rank @@
+Normal rank