Fault-Tolerant Routing in DeBruijn Comrnunication Networks

DOI10.1109/TC.1985.1676633zbMath0565.94027OpenAlexW2071712440MaRDI QIDQ3680762

S. Louis Hakimi, Abdol-Hossein Esfahanian

Publication date: 1985

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

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

zbMATH Keywords

connectivityrouting algorithmcomputer networksnode-connectivityDeBruijn digraphsmultiple processor systemsshift and replace graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (29)

Longest fault-free paths in hypercubes with vertex faults ⋮ A depth-first search routing algorithm for star graphs and its performance evaluation ⋮ Containment of butterflies in networks constructed by the line digraph operation ⋮ An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs ⋮ On the connectivity of the De Bruijn graph ⋮ Large fault-tolerant interconnection networks ⋮ An unoriented variation on de Bruijn sequences ⋮ A new approach for routing in arrangement graphs and its performance evaluation ⋮ Cycles in butterfly graphs ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Unnamed Item ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ Unnamed Item ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ Wide diameters of de Bruijn graphs ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Connectivity of Kautz networks ⋮ Super edge-connectivity of de Bruijn and Kautz undirected graphs ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Generalized de Bruijn graphs ⋮ Longest fault-free paths in star graphs with vertex faults ⋮ Approximate Moore graphs are good expanders ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ The Hamiltonian property of linear functions ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks

This page was built for publication: Fault-Tolerant Routing in DeBruijn Comrnunication Networks