Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959): Difference between revisions

@@ Property / cites work @@
+Reliable broadcasting in product networks
@@ Property / cites work: Reliable broadcasting in product networks / rank @@
+Normal rank
@@ Property / cites work @@
+Independent spanning trees in crossed cubes
@@ Property / cites work: Independent spanning trees in crossed cubes / rank @@
+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 @@
+Embedding a family of disjoint 3D meshes into a crossed cube
+Normal rank
@@ Property / cites work @@
+Edge-pancyclicity and path-embeddability of bijective connection graphs
+Normal rank
@@ Property / cites work @@
+Embedding meshes into crossed cubes
@@ Property / cites work: Embedding meshes into crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient unicast in bijective connection networks with the restricted faulty node set
+Normal rank
@@ Property / cites work @@
+Constructing edge-disjoint spanning trees in locally twisted cubes
+Normal rank
@@ Property / cites work @@
+Q4893438
@@ Property / cites work: Q4893438 / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
+Normal rank
@@ Property / cites work @@
+Embedding binary trees into crossed cubes
@@ Property / cites work: Embedding binary trees into crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
+Normal rank
@@ Property / cites work @@
+A fast fault-identification algorithm for bijective connection graphs using the PMC model
+Normal rank
@@ Property / cites work @@
+Constructing independent spanning trees for locally twisted cubes
+Normal rank
@@ Property / cites work @@
+An algorithm to construct independent spanning trees on parity cubes
+Normal rank
@@ Property / cites work @@
+Independent spanning trees on twisted cubes
@@ Property / cites work: Independent spanning trees on twisted cubes / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parallel construction of optimal independent spanning trees on hypercubes
+Normal rank
@@ Property / cites work @@
+Constructing edge-disjoint spanning trees in twisted cubes
+Normal rank
@@ Property / cites work @@
+Fault-tolerant cycle-embedding of crossed cubes
@@ Property / cites work: Fault-tolerant cycle-embedding of crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank