An algorithm to construct independent spanning trees on parity cubes
type: Item
instance of: scholarly article
title: An algorithm to construct independent spanning trees on parity cubes
zbMATH Open document ID: 1254.68191
author: Yan Wang
author: Jianxi Fan
author: He Huang
author: X.-H. Jia
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6122476
zbMATH Keywords: independent spanning tree
zbMATH Keywords: fault-tolerant broadcasting
zbMATH Keywords: secure message distribution
zbMATH Keywords: parity cube
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.08.020
OpenAlex ID: W1977478067
cites work: Reliable broadcasting in product networks
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Finding Four Independent Trees
cites work: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
cites work: Efficient unicast in bijective connection networks with the restricted faulty node set
cites work: Algorithms and Computation
cites work: Embedding meshes into locally twisted cubes
cites work: Constructing edge-disjoint spanning trees in locally twisted cubes
cites work: Independent trees in graphs
cites work: Independent trees in planar graphs
cites work: The multi-tree approach to reliability in distributed networks
cites work: Optimum broadcasting and personalized communication in hypercubes
cites work: Independent spanning trees on even networks
cites work: Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
cites work: Constructing independent spanning trees for locally twisted cubes
cites work: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
cites work: Independent Spanning Trees on Multidimensional Torus Networks
cites work: Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
cites work: The twisted-cube connected networks
cites work: Embedding meshes into twisted-cubes
cites work: Independent spanning trees on twisted cubes
cites work: Embedding of binomial trees in hypercubes with link faults
cites work: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
cites work: Constructing edge-disjoint spanning trees in twisted cubes
cites work: Three tree-paths
cites work: The spined cube: a new hypercube variant with smaller diameter
Wikidata QID: Q60402346
DOI: 10.1016/J.TCS.2012.08.020
description: scientific article; zbMATH DE number 6122476