A fast parallel algorithm for constructing independent spanning trees on parity cubes
type: Item
instance of: scholarly article
title: A fast parallel algorithm for constructing independent spanning trees on parity cubes
zbMATH Open document ID: 1410.05195
author: Yu-Huei Chang
author: Jinn-Shyong Yang
author: Jou-Ming Chang
author: Yue-Li Wang
published in: Applied Mathematics and Computation
publication date: 2019-03-18T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 7037694
zbMATH Keywords: parallel algorithms
zbMATH Keywords: independent spanning trees
zbMATH Keywords: parity cubes
zbMATH Keywords: interconnection networks
MaRDI profile type: Publication
full work available at URL: j.amc.2015.06.081
OpenAlex ID: W931020699
cites work: Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
cites work: Independent spanning trees in crossed cubes
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Finding Four Independent Trees
cites work: The multi-tree approach to reliability in distributed networks
cites work: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
cites work: The twisted-cube connected networks
cites work: Embedding meshes into twisted-cubes
cites work: An algorithm to construct independent spanning trees on parity cubes
cites work: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
cites work: Three tree-paths
DOI: 10.1016/J.AMC.2015.06.081
description: scientific article; zbMATH DE number 7037694