Vertex-independent spanning trees in complete Josephus cubes
From MaRDI portal
Publication:6652471
Recommendations
- Independent spanning trees in crossed cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- An algorithm to construct independent spanning trees on parity cubes
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Cites work
- A message distribution technique and its application to network control
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- An algorithm to construct independent spanning trees on parity cubes
- Broadcasting multiple messages in the 1-in port model in optimal time
- Cluster connectivity and super cluster connectivity of half hypercube networks
- Connectivity and super connectivity of folded hypercube-like networks
- Constructing independent spanning trees for locally twisted cubes
- Edge-independent spanning trees in folded crossed cubes
- Embedding meshes into twisted-cubes
- Finding Four Independent Trees
- Modelling simultaneous broadcasting by level-disjoint partitions
- Node set optimization problem for complete Josephus cubes
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- The Josephus Cube: analysis of routing and fault tolerance
- The Josephus cube: A novel interconnection network
- The multi-tree approach to reliability in distributed networks
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
This page was built for publication: Vertex-independent spanning trees in complete Josephus cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652471)
