Constructing independent spanning trees for locally twisted cubes
DOI10.1016/J.TCS.2010.12.061zbMATH Open1223.05026OpenAlexW1979256582MaRDI QIDQ533862FDOQ533862
James K. Lan, Chiuyuan Chen, Well Y. Chou, Yi-Jiun Liu
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
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
parallel algorithmhypercubesindependent spanning treeslocally twisted cubesdesign and analysis of algorithmsdata broadcastinghypercube variants
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)
Cites Work
- Constructing edge-disjoint spanning trees in locally twisted cubes
- The locally twisted cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Title not available (Why is that?)
- A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
- The multi-tree approach to reliability in distributed networks
- On independent spanning trees
- Independent trees in graphs
- Independent spanning trees of chordal rings
- 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
- Independent spanning trees with small depths in iterated line digraphs
- Independent trees in planar graphs
- Finding Four Independent Trees
- Reliable broadcasting in product networks
Cited In (21)
- A comment on ``Independent spanning trees in crossed cubes
- Independent spanning trees on twisted cubes
- Independent spanning trees in crossed cubes
- Locally exchanged twisted cubes: connectivity and super connectivity
- Edge-independent spanning trees in folded crossed cubes
- Construction independent spanning trees on locally twisted cubes in parallel
- Constructing edge-disjoint spanning trees in locally twisted cubes
- 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
- Vertex-transitivity on folded crossed cubes
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Constructing completely independent spanning trees in crossed cubes
- Vertex-independent spanning trees in complete Josephus cubes
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Constructing Node-Independent Spanning Trees in Augmented 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)
