Constructing independent spanning trees for locally twisted cubes

DOI10.1016/j.tcs.2010.12.061zbMath1223.05026MaRDI QIDQ533862

Chiuyuan Chen, James K. Lan, Yi-Jiun Liu, Well Y. Chou

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.061

zbMATH Keywords

hypercubes; parallel algorithm; independent spanning trees; locally twisted cubes; design and analysis of algorithms; data broadcasting; hypercube variants

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C05: Trees

68M10: Network design and communication in computer systems

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

Related Items

Independent spanning trees in crossed cubes, Locally exchanged twisted cubes: connectivity and super connectivity, Constructing completely independent spanning trees in crossed cubes, Independent spanning trees on twisted cubes, An algorithm to construct independent spanning trees on parity cubes, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Construction independent spanning trees on locally twisted cubes in parallel, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Vertex-transitivity on folded crossed cubes

Cites Work

• Unnamed Item
• Independent spanning trees of chordal rings
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• 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
• 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
• The locally twisted cubes
• A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
• Finding Four Independent Trees
• Independent spanning trees with small depths in iterated line digraphs