Finding shortest paths in distributed loop networks (Q293346): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+M14
@@ Property / Mathematics Subject Classification ID: 68M14 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M10
@@ Property / Mathematics Subject Classification ID: 68M10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M15
@@ Property / Mathematics Subject Classification ID: 68M15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590743
@@ Property / zbMATH DE Number: 6590743 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+distributed systems
@@ Property / zbMATH Keywords: distributed systems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+loop networks
@@ Property / zbMATH Keywords: loop networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+shortest path
@@ Property / zbMATH Keywords: shortest path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+modular arithmetic
@@ Property / zbMATH Keywords: modular arithmetic / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Reliable circulant networks with minimum transmission delay
+Normal rank
@@ Property / cites work @@
+Fault-tolerant routing in distributed loop networks
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:293346