Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

DOI10.1016/j.jpdc.2013.01.009zbMath1284.68449OpenAlexW2046433682WikidataQ60402285 ScholiaQ60402285MaRDI QIDQ2442959

Jin Wang, Baolei Cheng, Jianxi Fan, Xiao-Hua Jia

Publication date: 2 April 2014

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2013.01.009

zbMATH Keywords

independent spanning treecrossed cubeparallel constructiondimension-adjacent treeinternally disjoint path

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) 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 comment on ``Independent spanning trees in crossed cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ The generalized 4-connectivity of hypercubes ⋮ An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Cites Work

• Unnamed Item
• An efficient parallel construction of optimal independent spanning trees on hypercubes
• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• Constructing independent spanning trees for locally twisted cubes
• Efficient unicast in bijective connection networks with the restricted faulty node set
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
• Independent spanning trees on twisted cubes
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• The multi-tree approach to reliability in distributed networks
• Reliable broadcasting in product networks
• An algorithm to construct independent spanning trees on parity cubes
• Embedding meshes into crossed cubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Constructing edge-disjoint spanning trees in twisted cubes
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Embedding binary trees into crossed cubes
• Finding Four Independent Trees
• Independent spanning trees in crossed cubes

This page was built for publication: Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes