Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461): Difference between revisions

@@ Property / cites work @@
+Constructing Node-Independent Spanning Trees in Augmented Cubes
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Finding Four Independent Trees
@@ Property / cites work: Finding Four Independent Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
+Normal rank
@@ Property / cites work @@
+Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
+Normal rank
@@ Property / cites work @@
+Q4414501
@@ Property / cites work: Q4414501 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Constructing dual-CISTs of DCell data center networks
+Normal rank
@@ Property / cites work @@
+Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank