Independent spanning trees on twisted cubes
From MaRDI portal
Publication:663434
DOI10.1016/j.jpdc.2011.09.002zbMath1231.68093OpenAlexW2079922756WikidataQ60402383 ScholiaQ60402383MaRDI QIDQ663434
Jianxi Fan, Guodong Zhou, Yan Wang, Xiao-Hua Jia
Publication date: 14 February 2012
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.2011.09.002
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
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 ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Changing the diameter of the locally twisted cube ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks ⋮ Independent spanning trees in crossed cubes
Cites Work
- Unnamed Item
- Constructing independent spanning trees for locally twisted cubes
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements
- Efficient unicast in bijective connection networks with the restricted faulty node set
- 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
- Fault-tolerant Hamiltonicity of twisted cubes
- Embedding of tori and grids into twisted cubes
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Optimal fault-tolerant embedding of paths in twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding a family of meshes into twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- The multi-tree approach to reliability in distributed networks
- On independent spanning trees
- Independent trees in planar graphs
- Independent trees in graphs
- Reliable broadcasting in product networks
- Topological properties of twisted cube
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Constructing edge-disjoint spanning trees in twisted cubes
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- The locally twisted cubes
- Optimum broadcasting and personalized communication in hypercubes
- Finding Four Independent Trees
- Independent spanning trees with small depths in iterated line digraphs
