A new method for constructing infinite families of \(k\)-tight optimal double loop networks (Q862697): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11425-006-0525-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2127410034
@@ Property / OpenAlex ID: W2127410034 / rank @@
+Normal rank
@@ Property / cites work @@
+A very short proof of a conjecture concerning set‐to‐set broadcasting
+Normal rank
@@ Property / cites work @@
+A complementary survey on double-loop networks
@@ Property / cites work: A complementary survey on double-loop networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Related to Multimodule Memory Organizations
+Normal rank
@@ Property / cites work @@
+Q4499037
@@ Property / cites work: Q4499037 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4470839
@@ Property / cites work: Q4470839 / rank @@
+Normal rank
@@ Property / cites work @@
+An infinite family of 4-tight optimal double loop networks
+Normal rank
@@ Property / cites work @@
+Q3366923
@@ Property / cites work: Q3366923 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing of optimal double loop networks
@@ Property / cites work: Designing of optimal double loop networks / rank @@
+Normal rank