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

DOI10.1142/S0129054123500156zbMATH Open1543.05169MaRDI QIDQ6569892FDOQ6569892

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)

zbMATH Keywords

interconnection networkscompletely independent spanning treesdiameter of networkshierarchical folded cubic networks

Mathematics Subject Classification ID

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

Cites Work

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

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)