Constructing independent spanning trees for locally twisted cubes

DOI10.1016/J.TCS.2010.12.061MaRDI QIDQ533862zbMATH OpenOpenAlexFDO

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

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

parallel algorithmhypercubesindependent spanning treeslocally twisted cubesdesign and analysis of algorithmsdata broadcastinghypercube variants

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Hypergraphs (05C65) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Construction independent spanning trees on locally twisted cubes in parallel
• Independent spanning trees on twisted cubes
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees in crossed cubes

Cites work

• scientific article; zbMATH DE number 1696542 (Why is no real title available?)
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Independent spanning trees of chordal rings
• Independent spanning trees with small depths in iterated line digraphs
• Independent trees in graphs
• Independent trees in planar graphs
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• On independent spanning trees
• Reliable broadcasting in product networks
• The locally twisted cubes
• The multi-tree approach to reliability in distributed networks
• Three tree-paths

Cited in

(26)

• A comment on ``Independent spanning trees in crossed cubes
• Independent spanning trees on twisted cubes
• Locally exchanged twisted cubes: connectivity and super connectivity
• Independent spanning trees in crossed cubes
• Edge-independent spanning trees in folded crossed cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Construction independent spanning trees on locally twisted cubes in parallel
• Constructing node-independent spanning trees in augmented cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• A counterexample for the proof of implication conjecture on independent spanning trees
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Vertex-transitivity on folded crossed cubes
• The orbits of spined cubes
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Constructing completely independent spanning trees in crossed cubes
• The orbits of twisted cubes
• Vertex-independent spanning trees in complete Josephus cubes
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• The orbits of Möbius cubes
• Symmetric property and reliability of locally twisted cubes
• Linear time algorithms for finding independent spanning trees on pyramid networks
• An algorithm to construct independent spanning trees on parity cubes

This page was built for publication: Constructing independent spanning trees for locally twisted cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533862)