Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

DOI10.1016/j.dam.2011.04.014zbMath1225.68138OpenAlexW2035439570MaRDI QIDQ2275932

Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang

Publication date: 10 August 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.014

zbMATH Keywords

interconnection networksindependent spanning treesfolded hypercubesedge-disjoint spanning treesfault-tolerant broadcasting

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (14)

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 ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ Constructing dual-CISTs of folded divide-and-swap cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Parallel construction of multiple independent spanning trees on highly scalable datacenter networks ⋮ Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Cites Work

• Unnamed Item
• Independent spanning trees of chordal rings
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• On reliability of the folded hypercubes
• Some results on topological properties of folded hypercubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• The multi-tree approach to reliability in distributed networks
• Independent trees in planar graphs
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• On conditional diagnosability of the folded hypercubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Independent spanning trees on folded hyper-stars
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Constructing one-to-many disjoint paths in folded hypercubes
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Independent Spanning Trees on Multidimensional Torus Networks
• Optimum broadcasting and personalized communication in hypercubes
• Finding Four Independent Trees
• Independent spanning trees with small depths in iterated line digraphs

This page was built for publication: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes