The ( , d, d', - 1)-problem with applications to computer networks

DOI10.1007/BF02073596MaRDI QIDQ1179732zbMATH OpenOpenAlexFDO

Authors 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

designing transputer networkslarge graphs with maximum degreerobust networks

Mathematics Subject Classification ID

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

Recommendations

• On large ( , D, D, 1)-graphs
• Large graphs with given degree and diameter. II
• Diameter vulnerability of GC graphs
• Some large graphs with given degree and diameter

Cites work

• A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
• Distributed asynchronous computation of fixed points
• Dynamic behavior of shortest path routing algorithms for communication networks
• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3908346 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3432305 (Why is no real title available?)
• On Moore Graphs with Diameters 2 and 3
• On the existence of certain distance-regular graphs
• The general problem solving algorithm and its implementation

Cited in

(9)

• Diameter vulnerability of GC graphs
• Large (d,D, D',s)-bipartite digraphs
• Diameter-vulnerability of large bipartite digraphs
• The (\(\Delta, D\)) and (\(\Delta, N\)) problems or New Amsterdam and Manhattan digraphs
• On large ( , D, D, 1)-graphs
• scientific article; zbMATH DE number 3950393 (Why is no real title available?)
• Networks communicating for each pairing of terminals
• scientific article; zbMATH DE number 4126674 (Why is no real title available?)
• The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding

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

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