Edge-independent spanning trees in folded crossed cubes

DOI10.1016/j.tcs.2023.114053OpenAlexW4382932594MaRDI QIDQ6168082

Huanwen Zhang, Jianxi Fan, Yan Wang, Chang Shu

Publication date: 8 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114053

zbMATH Keywords

algorithmfault-toleranceedge-independent spanning treesfolded crossed cubes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Edge-independent spanning trees in augmented cubes
• Constructing independent spanning trees for locally twisted cubes
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• The multi-tree approach to reliability in distributed networks
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• The super connectivity of folded crossed cubes
• An algorithm to construct independent spanning trees on parity cubes
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Linear time algorithms for finding independent spanning trees on pyramid networks
• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
• Vertex-transitivity on folded crossed cubes

This page was built for publication: Edge-independent spanning trees in folded crossed cubes