Independent spanning trees in crossed cubes

DOI10.1016/j.ipl.2013.06.004zbMath1284.68046MaRDI QIDQ5920317

Tao Xiang, Yanhong Zhang, Wei Hao

Publication date: 11 April 2014

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

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

zbMATH Keywords

algorithms; interconnection networks; independent spanning trees; fault-tolerance; crossed cubes

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

68M07: Mathematical problems of computer architecture

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

A comment on ``Independent spanning trees in crossed 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

Cites Work

• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Constructing the nearly shortest path in crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Complete path embeddings in crossed cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• On the double-vertex-cycle-connectivity of crossed cubes
• Independent Spanning Trees on Multidimensional Torus Networks