An algorithm to construct independent spanning trees on parity cubes
From MaRDI portal
Publication:1929242
DOI10.1016/j.tcs.2012.08.020zbMath1254.68191OpenAlexW1977478067WikidataQ60402346 ScholiaQ60402346MaRDI QIDQ1929242
He Huang, Jianxi Fan, Yan Wang, Xiao-Hua Jia
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.020
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Linear time algorithms for finding independent spanning trees on pyramid networks
Cites Work
- Constructing independent spanning trees for locally twisted cubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Independent spanning trees on even networks
- Embedding meshes into twisted-cubes
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees on twisted cubes
- Embedding meshes into locally twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- The multi-tree approach to reliability in distributed networks
- Embedding of binomial trees in hypercubes with link faults
- The twisted-cube connected networks
- Independent trees in planar graphs
- Independent trees in graphs
- Reliable broadcasting in product networks
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- The spined cube: a new hypercube variant with smaller diameter
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Independent Spanning Trees on Multidimensional Torus Networks
- Optimum broadcasting and personalized communication in hypercubes
- Finding Four Independent Trees
- Algorithms and Computation
This page was built for publication: An algorithm to construct independent spanning trees on parity cubes
