Optimal broadcasting for locally twisted cubes
From MaRDI portal
Recommendations
- Optimum broadcasting and personalized communication in hypercubes
- Communication Performance Evaluation of the Locally Twisted Cube
- On optimal broadcasting in faulty hypercubes
- Neighborhood Broadcasting in Hypercubes
- Optimal broadcast on parallel locality models
- Optimal broadcasting in hypercubes with dynamic faults
- An optimal multicast algorithm for cube-connected cycles
- Distributed Broadcast Revisited: Towards Universal Optimality
- scientific article; zbMATH DE number 1138357
Cites work
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Embedding meshes into locally twisted cubes
- Fault-tolerant analysis of a class of networks
- Fault-tolerant pancyclicity of augmented cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Locally twisted cubes are 4-pancyclic.
- Panconnectivity of locally twisted cubes
- Parallel concepts in graph theory
- The locally twisted cubes
Cited in
(6)- An efficient algorithm to construct disjoint path covers of DCell networks
- One-to-one communication in twisted cubes under restricted connectivity
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- One-to-one disjoint path covers on alternating group graphs
- Communication Performance Evaluation of the Locally Twisted Cube
- Transmitting in the \(n\)-dimensional cube
This page was built for publication: Optimal broadcasting for locally twisted cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413259)