A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2015.06.081
+Normal rank
@@ Property / OpenAlex ID @@
+W931020699
@@ Property / OpenAlex ID: W931020699 / rank @@
+Normal rank
@@ Property / cites work @@
+Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
+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 @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
+Normal rank
@@ Property / cites work @@
+The twisted-cube connected networks
@@ Property / cites work: The twisted-cube connected networks / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding meshes into twisted-cubes
@@ Property / cites work: Embedding meshes into twisted-cubes / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to construct independent spanning trees on parity cubes
+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