The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks

DOI10.1007/BF02073596zbMath0743.90051OpenAlexW2002987751MaRDI QIDQ1179732

V. J. Rayward-Smith, A. P. Revitt, J. Luis A. Yebra

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02073596

zbMATH Keywords

robust networksdesigning transputer networkslarge graphs with maximum degree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (3)

Large \((d,D, D',s)\)-bipartite digraphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ On large (Δ, D, D, 1)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The general problem solving algorithm and its implementation
• On the existence of certain distance-regular graphs
• On Moore Graphs with Diameters 2 and 3
• Distributed asynchronous computation of fixed points
• A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
• Dynamic behavior of shortest path routing algorithms for communication networks

This page was built for publication: The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks