A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks

DOI10.1142/S0129054123500156MaRDI QIDQ6569892zbMATH OpenFDO

Authors Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang

Publication date 9 July 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123500156

zbMATH Keywords

completely independent spanning treesdiameter of networkshierarchical folded cubic networksinterconnection networks

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Constructing dual-CISTs of folded divide-and-swap cubes
• Constructing dual-CISTs of DCell data center networks
• Reliability analysis based on the dual-CIST in shuffle-cubes
• Constructing tri-CISTs in shuffle-cubes
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing

Cites work

• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Completely independent spanning trees in the underlying graph of a line digraph
• Component conditional fault tolerance of hierarchical folded cubic networks
• Constructing completely independent spanning trees in crossed cubes
• Constructing dual-CISTs of DCell data center networks
• Constructing dual-CISTs of folded divide-and-swap cubes
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Constructing two completely independent spanning trees in hypercube-variant networks
• Fault tolerance analysis of hierarchical folded cube
• Fault-tolerant cycle embedding in hierarchical cubic networks
• Hamiltonicity of the hierarchical cubic network
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• Node‐disjoint paths and related problems on hierarchical cubic networks
• On g-extra conditional diagnosability of hierarchical cubic networks
• On conditional fault tolerance and diagnosability of hierarchical cubic networks
• On conditional fault tolerance of hierarchical cubic networks
• Reliability analysis based on the dual-CIST in shuffle-cubes
• Sufficient conditions for protection routing in IP networks
• The generalized 4-connectivity of hierarchical cubic networks
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• Two counterexamples on completely independent spanning trees

Cited in

(1)

• The 4-set tree connectivity of hierarchical folded hypercube

This page was built for publication: A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569892)