Construction independent spanning trees on locally twisted cubes in parallel
From MaRDI portal
Publication:2359799
DOI10.1007/s10878-016-0018-8zbMath1367.05032OpenAlexW2345184394MaRDI QIDQ2359799
Yue-Li Wang, Jinn-Shyong Yang, Jou-Ming Chang, Sun-Yuan Hsieh, Yu-Huei Chang
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0018-8
parallel algorithmsinterconnection networksindependent spanning treesedge-disjoint spanning treeslocally twisted cubes
Analysis of algorithms (68W40) Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks, Embedding mutually edge-disjoint cycles into locally twisted cubes, Linear time algorithms for finding independent spanning trees on pyramid networks, A two-stages tree-searching algorithm for finding three completely independent spanning trees, 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
- Unnamed Item
- Independent spanning trees of chordal rings
- An efficient parallel construction of optimal independent spanning trees on hypercubes
- A comment on ``Independent spanning trees in crossed cubes
- Constructing independent spanning trees for locally twisted cubes
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Independent spanning trees on even networks
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees on twisted cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Embedding meshes into locally twisted cubes
- 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
- Independent trees in graphs
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Locally twisted cubes are 4-pancyclic.
- An algorithm to construct independent spanning trees on parity cubes
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Panconnectivity of locally twisted cubes
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
- Independent spanning trees on folded hyper-stars
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- The locally twisted cubes
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
- A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
- Independent Spanning Trees on Multidimensional Torus Networks
- Finding Four Independent Trees
- Independent spanning trees in crossed cubes
