A comment on ``Independent spanning trees in crossed cubes

DOI10.1016/j.ipl.2014.06.015zbMath1358.68020OpenAlexW1977370680MaRDI QIDQ402393

Jinn-Shyong Yang, Jhen-Ding Wang, Kung-Jui Pai, Jou-Ming Chang

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.015

zbMATH Keywords

interconnection networksindependent spanning treescrossed cubesmultiply-twisted hypercube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Construction independent spanning trees on locally twisted cubes in parallel ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ Linear time algorithms for finding independent spanning trees on pyramid networks ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Cites Work

• Connectivity of the crossed cube
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• The multi-tree approach to reliability in distributed networks
• Topological properties of the crossed cube architecture
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Finding Four Independent Trees
• Independent spanning trees in crossed cubes
• Independent spanning trees in crossed cubes