A fast parallel algorithm for constructing independent spanning trees on parity cubes

DOI10.1016/J.AMC.2015.06.081MaRDI QIDQ668143zbMATH OpenOpenAlexFDO

Authors Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang

Publication date 18 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.06.081

zbMATH Keywords

independent spanning treesinterconnection networksparallel algorithmsparity cubes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• An algorithm to construct independent spanning trees on parity cubes
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• Construction independent spanning trees on locally twisted cubes in parallel
• Independent spanning trees in crossed cubes
• A comment on ``Independent spanning trees in crossed cubes

Cites work

• An algorithm to construct independent spanning trees on parity cubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Embedding meshes into twisted-cubes
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Independent spanning trees in crossed cubes
• The multi-tree approach to reliability in distributed networks
• The twisted-cube connected networks
• Three tree-paths
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cited in

(10)

• An algorithm to construct independent spanning trees on parity cubes
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
• 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
• Modelling simultaneous broadcasting by level-disjoint partitions
• Construction independent spanning trees on locally twisted cubes in parallel
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• Edge-independent spanning trees in augmented cubes
• Independent spanning trees in crossed cubes

This page was built for publication: A fast parallel algorithm for constructing independent spanning trees on parity cubes

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