A parallel algorithm for constructing independent spanning trees in twisted cubes
From MaRDI portal
Publication:505426
DOI10.1016/j.dam.2016.11.017zbMath1354.05025MaRDI QIDQ505426
Ting-Jyun Yang, Jou-Ming Chang, Jinn-Shyong Yang
Publication date: 23 January 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.017
68W40: Analysis of algorithms
05C05: Trees
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68W10: Parallel algorithms in computer science
05C40: Connectivity
Related Items
Reliability analysis of twisted cubes, Cycles embedding in balanced hypercubes with faulty edges and vertices, A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
Cites Work
- A comment on ``Independent spanning trees in crossed cubes
- Geodesic pancyclicity of twisted cubes
- Independent spanning trees on twisted cubes
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
- Embedding of tori and grids into twisted cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding a family of meshes into twisted cubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- The multi-tree approach to reliability in distributed networks
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Paths and cycles identifying vertices in twisted cubes
- Topological properties of twisted cube
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- On embedding cycles into faulty twisted cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Finding Four Independent Trees
