A parallel algorithm for constructing independent spanning trees in twisted cubes

DOI10.1016/J.DAM.2016.11.017MaRDI QIDQ505426zbMATH OpenOpenAlexFDO

Authors Jou-Ming Chang, Ting-Jyun Yang, 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

zbMATH Keywords

independent spanning treesinterconnection networksparallel algorithmstwisted cubes

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Construction independent spanning trees on locally twisted cubes in parallel
• A fast parallel algorithm for constructing independent spanning trees on parity cubes
• An algorithm to construct independent spanning trees on parity cubes
• Independent spanning trees on twisted cubes
• Constructing independent spanning trees for locally twisted cubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Constructing edge-disjoint spanning trees in twisted cubes
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• Euro-Par 2004 Parallel Processing

Cites work

• A comment on ``Independent spanning trees in crossed cubes
• A fast parallel algorithm for constructing independent spanning trees on parity cubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• Embedding a family of meshes into twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• Embedding of tori and grids into twisted cubes
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Geodesic pancyclicity of twisted cubes
• Independent spanning trees on twisted cubes
• On embedding cycles into faulty twisted cubes
• Optimal fault-tolerant embedding of paths in twisted cubes
• Paths and cycles identifying vertices in twisted cubes
• The multi-tree approach to reliability in distributed networks
• Three tree-paths
• Topological properties of twisted cube
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cited in

(14)

• Reliability analysis of twisted cubes
• Cycles embedding in balanced hypercubes with faulty edges and vertices
• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
• Construction independent spanning trees on locally twisted cubes in parallel
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees in crossed cubes
• Independent spanning trees on twisted cubes
• Vertex-independent spanning trees in complete Josephus cubes
• A fast parallel algorithm for constructing independent spanning trees on parity cubes

This page was built for publication: A parallel algorithm for constructing independent spanning trees in twisted cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505426)