scientific article; zbMATH DE number 4201663

MaRDI QIDQ3350798zbMATH OpenFDO

Authors Jean-Claude Bermond, G. Illiades, Claudine Peyrat

Publication date 1989

zbMATH Keywords

diameter

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Computational and Information Science
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Optimal double-loop networks with non-unit steps
• scientific article; zbMATH DE number 1908099
• An efficient algorithm to find optimal double loop networks

Cited in

(15)

• Minimum chromaticity of circulant graphs
• Distributed loop network with minimum transmission delay
• Searching for large multi-loop networks
• Computing the Diameter in Multiple-Loop Networks
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
• Graded Betti numbers of some families of circulant graphs
• A survey on multi-loop networks.
• Hamiltonian decomposition of Cayley graphs of degree 4
• Network properties of double and triple fixed step graphs
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Broadcasting in the butterfly network
• Large fault-tolerant interconnection networks
• Multiplicative circulant networks. Topological properties and communication algorithms
• Fault-tolerant routings in double fixed-step networks

This page was built for publication:

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