Independent Spanning Trees on Multidimensional Torus Networks

DOI10.1109/TC.2009.98zbMath1368.68274OpenAlexW2096005292MaRDI QIDQ5280831

Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2009.98

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (19)

Construction independent spanning trees on locally twisted cubes in parallel ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ An approach to conditional diagnosability analysis under the PMC model and its application to torus networks ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Completely independent spanning trees in torus networks ⋮ Independent spanning trees on even networks ⋮ Structural properties of subdivided-line graphs ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Independent spanning trees on folded hyper-stars ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Independent spanning trees in crossed cubes ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Linear time algorithms for finding independent spanning trees on pyramid networks ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent spanning trees in crossed cubes

This page was built for publication: Independent Spanning Trees on Multidimensional Torus Networks