Fault-tolerant routings in double fixed-step networks

DOI10.1016/S0166-218X(97)00015-2zbMath0890.68099OpenAlexW2069587263MaRDI QIDQ1377656

M. Zaragozà, J. Fàbrega

Publication date: 11 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

loop networksfault-tolerant routing

Mathematics Subject Classification ID

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

Related Items (7)

A survey on multi-loop networks. ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS ⋮ The number of spanning trees in a class of double fixed-step loop networks ⋮ Connectivity and diameter in distance graphs ⋮ Wavelength routing of uniform instances in all-optical rings ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large fault-tolerant interconnection networks
• Distributed loop network with minimum transmission delay
• An efficient algorithm to find optimal double loop networks
• Minimal diameter double-loop networks: Dense optimal families
• A combinatorial problem related to distributed loop networks
• Reliable circulant networks with minimum transmission delay
• Minimal diameter double-loop networks. I. Large infinite optimal families
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Undirected loop networks

This page was built for publication: Fault-tolerant routings in double fixed-step networks