Vertex-independent spanning trees in complete Josephus cubes
From MaRDI portal
Publication:6652471
DOI10.1016/j.tcs.2024.114969MaRDI QIDQ6652471
Jianxi Fan, Baolei Cheng, Qi He, Yan Wang
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Constructing independent spanning trees for locally twisted cubes
- Embedding meshes into twisted-cubes
- The multi-tree approach to reliability in distributed networks
- Broadcasting multiple messages in the 1-in port model in optimal time
- An algorithm to construct independent spanning trees on parity cubes
- The Josephus cube: A novel interconnection network
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- Modelling simultaneous broadcasting by level-disjoint partitions
- Node set optimization problem for complete Josephus cubes
- The Josephus Cube: analysis of routing and fault tolerance
- A message distribution technique and its application to network control
- Finding Four Independent Trees
- Connectivity and super connectivity of folded hypercube-like networks
- Edge-independent spanning trees in folded crossed cubes
- Cluster connectivity and super cluster connectivity of half hypercube networks
This page was built for publication: Vertex-independent spanning trees in complete Josephus cubes